Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A051049
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A051049
Number of moves needed to solve an n-ring baguenaudier if the two end rings can be moved simultaneously.
+0
9
1, 1, 4, 7, 16, 31, 64, 127, 256, 511, 1024, 2047, 4096, 8191, 16384, 32767, 65536, 131071, 262144, 524287, 1048576, 2097151, 4194304, 8388607, 16777216, 33554431, 67108864, 134217727, 268435456, 536870911, 1073741824
(
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 8 08:31 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
