A008997 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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

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

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

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

CROSSREFS

KEYWORD

nonn,nice,more

AUTHOR

STATUS

approved