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!)
A036601 Number of binary rooted trees with n nodes and height exactly 12. 1

%I #15 Dec 20 2020 03:36:20

%S 0,0,0,0,0,0,0,0,0,0,0,0,1,11,65,283,1030,3335,9952,27987,75287,

%T 195752,495613,1228577,2994065,7195616,17094566,40219347,93848187,

%U 217433025,500640356,1146414797,2612325990,5926402180,13390758445

%N Number of binary rooted trees with n nodes and height exactly 12.

%H Alois P. Heinz, <a href="/A036601/b036601.txt">Table of n, a(n) for n = 0..4095</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,14

%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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)