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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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
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

5,5

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=5..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.

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

CROSSREFS

Cf. A003035, A006065.

Sequence in context: A123576 A094824 A029054 * A005851 A275247 A237121

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 06:30 EST 2016. Contains 278749 sequences.