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

%I #15 Dec 19 2020 11:28:45

%S 1,1,1,2,3,6,11,23,46,98,206,441,928,1951,4046,8349,17062,34703,70112,

%T 141071,282420,563333,1119020,2215310,4369699,8591513,16836216,

%U 32891454,64057841,124388194,240827283,464938673,895070853,1718386387

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

%H Alois P. Heinz, <a href="/A036592/b036592.txt">Table of n, a(n) for n = 0..511</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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)