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

%I #15 Dec 19 2020 14:49:47

%S 0,0,0,0,0,0,0,0,1,7,27,81,213,516,1183,2610,5597,11737,24154,48934,

%T 97729,192777,375859,725259,1385706,2623894,4925791,9173476,16952955,

%U 31103472,56666571,102552641,184396932,329502786,585240171,1033392428

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

%H Alois P. Heinz, <a href="/A036597/b036597.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,10

%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 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)