cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 2, 4, 8, 20
Offset: 0

Views

Author

Keywords

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.

Crossrefs

Cf. A000980.