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-2 of 2 results.

A350998 a(n) is the number of boards in English Peg Solitaire, reached after n moves, for which no more moves are possible.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 4, 0, 28, 66, 40, 176, 302, 816, 2675, 6890, 15122, 25846, 33891, 33051, 23722, 13142, 4987, 1295, 254, 28, 5
Offset: 0

Views

Author

Douglas Boffey, Jan 28 2022

Keywords

Crossrefs

A355295 Number of distinct board states reachable in n jumps in European Peg Solitaire.

Original entry on oeis.org

1, 4, 17, 92, 495, 2475, 11771, 52226, 212527, 789228, 2640323, 7870055, 20730606, 47916748, 96715832, 170154214, 260956703, 349541944, 410294786, 423631649, 385887175, 310724581, 221398196, 139580751, 77748102, 38162987, 16445627, 6178002, 2007607, 559163, 131269, 25378, 4012, 481, 36, 4
Offset: 0

Views

Author

Sander G. Huisman, Jun 27 2022

Keywords

Examples

			The beginning state is missing the peg just above the center, as an initial state with the center peg removed does not yield any valid solutions where 1 peg is remaining.
       * * *
     * * * * *
   * * * O * * *
   * * * * * * *
   * * * * * * *
     * * * * *
       * * *
The next move yields the next 4 states:
       * * *             * * *             * O *             * * *
     * * * * *         * * * * *         * * O * *         * * * * *
   * O O * * * *     * * * * * * *     * * * * * * *     * * * * O O *
   * * * * * * *     * * * O * * *     * * * * * * *     * * * * * * *
   * * * * * * *     * * * O * * *     * * * * * * *     * * * * * * *
     * * * * *         * * * * *         * * * * *         * * * * *
       * * *             * * *             * * *             * * *
		

Crossrefs

Showing 1-2 of 2 results.