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!)
A036589 Number of binary rooted trees with n nodes and height at most 6. 2

%I #15 Dec 19 2020 03:12:00

%S 1,1,1,2,3,6,11,22,39,70,118,200,324,526,825,1290,1958,2952,4335,6305,

%T 8948,12547,17183,23200,30593,39697,50305,62641,76157,90883,105860,

%U 120915,134719,147040,156412,162812,164968,163377,157278

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

%H Alois P. Heinz, <a href="/A036589/b036589.txt">Table of n, a(n) for n = 0..63</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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)