Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


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

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

Advanced Search

Back to Topic List Back to Topic List  
dan73

Posts: 465
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 --
1,2,3,4,5,6,7,8,9...
Thus creating this palindrome sequence of sums for all
the correct moves --
1)2,1)3,1,2,1)4,1,2,1,3,1,2,1)5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1)...
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.

Dan



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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.