Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036592
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036592 Number of binary rooted trees with n nodes and height at most 9. +0
1
1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 206, 441, 928, 1951, 4046, 8349, 17062, 34703, 70112, 141071, 282420, 563333, 1119020, 2215310, 4369699, 8591513, 16836216, 32891454, 64057841, 124388194, 240827283, 464938673, 895070853, 1718386387 (list; graph; listen)
OFFSET

0,4

LINKS

E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees)., J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.

Index entries for sequences related to rooted trees

CROSSREFS

Sequence in context: A093304 A036590 A036591 this_sequence A001190 A036656 A090344

Adjacent sequences: A036589 A036590 A036591 this_sequence A036593 A036594 A036595

KEYWORD

nonn,fini

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research