A051049 - cp's OEIS frontend

A051049 Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.

n	a(n)
0	1
1	1
2	4
3	7
4	16
5	31
6	64
7	127
8	256
9	511
10	1024
11	2047
12	4096
13	8191
14	16384
15	32767
16	65536
17	131071
18	262144
19	524287
20	1048576
21	2097151
22	4194304
23	8388607
24	16777216
25	33554431
26	67108864
27	134217727
28	268435456
29	536870911
30	1073741824

[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]

cp's OEIS Frontend

A051049 Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.

Table of values

List of values