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.

Showing 1-3 of 3 results.

A112737 On the standard 33-hole cross-shaped peg solitaire board, the number of distinct board positions after n jumps (starting with the center vacant).

Original entry on oeis.org

1, 1, 2, 8, 39, 171, 719, 2757, 9751, 31312, 89927, 229614, 517854, 1022224, 1753737, 2598215, 3312423, 3626632, 3413313, 2765623, 1930324, 1160977, 600372, 265865, 100565, 32250, 8688, 1917, 348, 50, 7, 2, 0
Offset: 0

Views

Author

George Bell (gibell(AT)comcast.net), Sep 16 2005

Keywords

Comments

If symmetry is not taken into account, these numbers are approximately 8 times larger (except for those at the start). The sum of this (finite) sequence is 23475688, the total number of distinct board positions that can be reached from the central vacancy on the 33-hole peg solitaire board.

Examples

			There are four possible first jumps, but they all lead to the same board position (rotationally equivalent), thus a(1)=1.
		

Crossrefs

A112738 On the standard 33-hole cross-shaped peg solitaire board, the number of distinct board positions after n jumps that can still be reduced to one peg at the center (starting with the center vacant).

Original entry on oeis.org

1, 1, 2, 8, 38, 164, 635, 2089, 6174, 16020, 35749, 68326, 112788, 162319, 204992, 230230, 230230, 204992, 162319, 112788, 68326, 35749, 16020, 6174, 2089, 635, 164, 38, 8, 2, 1, 1, 0
Offset: 0

Views

Author

George Bell (gibell(AT)comcast.net), Sep 16 2005

Keywords

Comments

The reason the sequence is palindromic is because playing the game backward is the same as playing it forward, with the notions of "hole" and "peg" interchanged.

Examples

			There are four possible first jumps, but they all lead to the same board position (rotationally equivalent), thus a(1)=1.
		

Crossrefs

Formula

Satisfies a(n)=a(31-n) for 0<=n<=31 (sequence is a palindrome).

A125730 Minimal number of initial pieces needed to reach level n in the Solitaire Army game when diagonal jumps are allowed.

Original entry on oeis.org

1, 2, 3, 5, 8, 13, 23, 46, 123
Offset: 0

Views

Author

George I. Bell (gibell(AT)comcast.net), Feb 02 2007

Keywords

Comments

Note that the first six terms are Fibonacci numbers.

Examples

			a(1)=2 because it takes 2 men to go one step or level forward.
		

References

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

Crossrefs

Formula

It is easy to show that a(n) >= a(n-1)+a(n-2). However, finding the last 3 terms in this sequence is not easy.
Showing 1-3 of 3 results.