The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: The tower of Hanoi and a palindrome sequence.
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 468
From: ct
Registered: 6/14/08
The tower of Hanoi and a palindrome sequence.
Posted: Nov 20, 2012 9:33 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

For a 3 peg Tower of Hanoi

The total sum of each disk for every time it is
correctly moved for any (n) stack moves = A000295 in
OEIS. Where the sum values for each disk is --
Thus creating this palindrome sequence of sums for all
the correct moves --
Then accumulating the sum at each break point ')' as
output =
1,4,11,26,57.. = A000295 in OEIS.

This is related to my last post on the tower of Hanoi.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.