Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125295
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125295 Number of different non-self-crossing ways of moving a tower of Hanoi from one peg onto another peg. +0
1
1, 2, 12, 1872, 6563711232, 282779810171805015122254036992, 22612323802416302740572466532905158028496454353087246911545156210129751385945830\ 223511552 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research