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 A008997 #24 Feb 16 2025 08:32:32 %S A008997 0,0,0,0,1,1,1,1,2,2,2,3,3,4,6,6,7,9,10,11 %N A008997 Orchard problem with 5 trees in a row (may not have all been proved optimal). %C A008997 Berloquin shows that a(21) >= 12. %D A008997 S. A. Burr, B. Grünbaum and N. J. A. Sloane, The Orchard Problem, Geometriae Dedicata, 2 (1974), 397-424. %D A008997 M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, Chap. 22. %H A008997 P. Berloquin, <a href="/A008997/a008997.jpg">a(21) >= 12</a> (from an article in Jeux & Strategies from 1983 - see Fig. 13) %H A008997 S. A. Burr, B. Grünbaum and N. J. A. Sloane, <a href="http://neilsloane.com/doc/ORCHARD/orchard.html">The Orchard Problem</a>, Geometriae Dedicata, 2 (1974), 397-424. %H A008997 Erich Friedman, <a href="https://erich-friedman.github.io/packing/trees/">Table of values and bounds for up to 21 trees</a> %H A008997 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Orchard-PlantingProblem.html">Orchard-Planting Problem</a> %Y A008997 Cf. A003035, A006065. %K A008997 nonn,nice,more %O A008997 1,9 %A A008997 _N. J. A. Sloane_