dan73
Posts:
468
From:
ct
Registered:
6/14/08


The tower of Hanoi and a palindrome sequence.
Posted:
Nov 20, 2012 9:33 AM


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

