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

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.

Terms

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

External references