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

%I

%S 1,1,1,2,3,6,11,23,46,97,198,406,811,1613,3155,6141,11822,22652,43052,

%T 81441,153031,286187,532067,984509,1811933,3319129,6049533,10975090,

%U 19815546,35613904,63710026,113457471,201128376,354949071

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

%H Alois P. Heinz, <a href="/A036591/b036591.txt">Table of n, a(n) for n = 0..255</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 5 00:04 EST 2023. Contains 360082 sequences. (Running on oeis4.)