login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036590 Number of binary rooted trees with n nodes and height at most 7. 2

%I

%S 1,1,1,2,3,6,11,23,45,90,171,325,598,1097,1972,3531,6225,10915,18898,

%T 32507,55302,93410,156208,259250,426227,695235,1123742,1801614,

%U 2862591,4510432,7043455,10904830,16731444,25446285,38349306,57278489

%N Number of binary rooted trees with n nodes and height at most 7.

%H Alois P. Heinz, <a href="/A036590/b036590.txt">Table of n, a(n) for n = 0..127</a>

%H E. M. Rains and N. J. A. Sloane, <a href="https://cs.uwaterloo.ca/journals/JIS/cayley.html">On Cayley's Enumeration of Alkanes (or 4-Valent Trees)</a>, J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

%K nonn,fini,full

%O 0,4

%A _N. J. A. Sloane_.

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 1 17:02 EST 2023. Contains 359993 sequences. (Running on oeis4.)