login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008997 Orchard problem with 5 trees in a row (may not have all been proved optimal). 3
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

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

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.

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: A123576 A094824 A029054 * A005851 A275247 A293440

Adjacent sequences:  A008994 A008995 A008996 * A008998 A008999 A009000

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 06:41 EDT 2019. Contains 323386 sequences. (Running on oeis4.)