A014225 Number of initial pieces needed to reach level n in the Solitaire Army game.

1, 2, 4, 8, 20

Offset

0,2

Comments

Level 4 is the highest level that can be reached.

References

E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 715.

Links

Table of n, a(n) for n=0..4.

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

Sequence in context: A034767 A005518 A326997 * A217520 A124154 A296606

Adjacent sequences: A014222 A014223 A014224 * A014226 A014227 A014228

Keyword

nonn,fini,full

Author

N. J. A. Sloane.

Status

approved