A014225 Number of initial pieces needed to reach level n in the Solitaire Army game.
1, 2, 4, 8, 20
Offset: 0
References
- E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 715.
Links
- Burkard Polster, How did Fibonacci beat the Solitaire army?, Mathologer video, 2022.
- Zvezdelina Stankova and Brady Haran, Conway Checkers (proof), Numberphile video, 2018.
- Eric Weisstein's World of Mathematics, Conway's Soldiers
Crossrefs
Cf. A000980.
Comments