login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014225 Number of initial pieces needed to reach level n in the Solitaire Army game. 4
1, 2, 4, 8, 20 (list; graph; refs; listen; history; text; internal format)
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.

Zvezdelina Stankova and Brady Haran, Conway Checkers (proof), Numberphile video, 2018.

Eric Weisstein's World of Mathematics, Conway's Soldiers

CROSSREFS

Sequence in context: A287025 A034767 A005518 * A217520 A124154 A296606

Adjacent sequences:  A014222 A014223 A014224 * A014226 A014227 A014228

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 15:26 EDT 2019. Contains 325143 sequences. (Running on oeis4.)