Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003035
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003035 Maximal number of 3-tree rows in n-tree orchard problem.
(Formerly M0982)
+0
4
1, 1, 2, 4, 6, 7, 10, 12, 16, 19, 22, 26 (list; graph; listen)
OFFSET

3,3

REFERENCES

S. A. Burr, in The Mathematical Gardner, Ed. D. A. Klarner, p. 94, Wadsworth, 1981.

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

H. E. Dudeney, Amusements in Mathematics, Nelson, London, 1917, page 56.

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

B. Gr\"{u}nbaum, Arrangements and Spreads. American Mathematical Society, Providence, RI, 1972, p. 22.

LINKS

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

N. J. A. Sloane, Illustration of initial terms (from Gruenbaum-Burr-Sloane paper)

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Link to the result [From Du, Zhao Hui (zhao.hui.du(AT)gmail.com), Nov 20 2008]

CROSSREFS

Cf. A006065, A008997, A058212.

Adjacent sequences: A003032 A003033 A003034 this_sequence A003036 A003037 A003038

Sequence in context: A047510 A071260 A026407 this_sequence A094453 A026398 A070119

KEYWORD

nonn,nice,hard

AUTHOR

njas

EXTENSIONS

13 and 14 trees result from Du, Zhao Hui (zhao.hui.du(AT)gmail.com), Nov 20 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:16 EST 2009. Contains 152824 sequences.


AT&T Labs Research