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.
offset: 0
codomain: ℕ
Declarations
Section titled “Declarations”- A051049computable
Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.