A008997 Orchard problem with 5 trees in a row (may not have all been proved optimal).

0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 9, 10, 11

Offset

1,9

Comments

Berloquin shows that a(21) >= 12.

References

S. A. Burr, B. Grünbaum and N. J. A. Sloane, The Orchard Problem, Geometriae Dedicata, 2 (1974), 397-424.

M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, Chap. 22.

Links

Table of n, a(n) for n=1..20.

P. Berloquin, a(21) >= 12 (from an article in Jeux & Stratégies from 1983 - see Fig. 13)

Thomas Bloom, Problem 669, Erdős Problems.

Stefan A. Burr, Branko Grünbaum and N. J. A. Sloane, The Orchard Problem, Geometriae Dedicata, 2 (1974), 397-424.

Erdős problems database contributors, Erdős problem database, see no. 669.

Erich Friedman, Table of values and bounds for up to 21 trees

Eric Weisstein's World of Mathematics, Orchard-Planting Problem

Crossrefs

Cf. A003035, A006065.

Sequence in context: A029054 A380481 A341452 * A341453 A341454 A341455

Adjacent sequences: A008994 A008995 A008996 * A008998 A008999 A009000

Keyword

nonn,nice,more

Author

N. J. A. Sloane

Status

approved