|
Search: id:A160002
|
|
|
| A160002 |
|
Number of moves needed to solve 4-peg Tower of Hanoi Puzzle with n disks |
|
+0
1
|
|
| 0, 3, 10, 19, 34, 57, 88, 123, 176, 253, 342, 449, 572, 749, 980, 1261, 1560
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Move n disks from the first peg to the last peg. Disks can only move between adjacent pegs in a move.
|
|
LINKS
|
A Chinese web page containing the problem and the first 13 terms
|
|
EXAMPLE
|
For n=2, 10 moves needed:
0: {1,2},{},{},{}
1: {2},{1},{},{}
2: {2},{},{1},{}
3: {2},{},{},{1}
4: {},{2},{},{1}
5: {},{},{2},{1}
6: {},{},{1,2},{}
7: {},{1},{2},{}
8: {},{1},{},{2}
9: {},{},{1},{2}
10: {},{},{},{1,2}
|
|
CROSSREFS
|
Cf. A007664. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2009]
Adjacent sequences: A159999 A160000 A160001 this_sequence A160003 A160004 A160005
Sequence in context: A028878 A010896 A135446 this_sequence A027177 A048343 A056789
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Yi Yang (YangYi0526(AT)163.com), Apr 29 2009
|
|
EXTENSIONS
|
Added three more terms Yi Yang (YangYi0526(AT)163.com), Nov 02 2009
|
|
|
Search completed in 0.002 seconds
|
