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.
%I A125730 #14 Feb 16 2025 08:33:04 %S A125730 1,2,3,5,8,13,23,46,123 %N A125730 Minimal number of initial pieces needed to reach level n in the Solitaire Army game when diagonal jumps are allowed. %C A125730 Note that the first six terms are Fibonacci numbers. %D A125730 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 715. %H A125730 M. Aigner, <a href="http://www.jstor.org/stable/2691046">Moving into the desert with Fibonacci</a>, Mathematics Magazine, 70 (1997), 11-21. %H A125730 G. I. Bell, <a href="http://www.gibell.net/pegsolitaire/army/index.html">The peg solitaire army</a>. %H A125730 G. I. Bell, D. S. Hirschberg and P. Guerrero-Garcia, <a href="https://arxiv.org/abs/math/0612612">The minimum size required of a solitaire army</a>, arXiv:math/0612612 [math.CO], 2006-2007. %H A125730 N. Eriksen, H. Eriksson and K. Eriksson, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v7i1r3">Diagonal checker-jumping and Eulerian numbers for color-signed permutations</a>, Electron. J. Combin., 7 (2000), #R3. %H A125730 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConwaysSoldiers.html">Conway's Soldiers</a>. %F A125730 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. %e A125730 a(1)=2 because it takes 2 men to go one step or level forward. %Y A125730 Cf. A014225, A014227. %K A125730 fini,full,nonn %O A125730 0,2 %A A125730 George I. Bell (gibell(AT)comcast.net), Feb 02 2007