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!)
A048809 Number of rooted trees with n nodes with every leaf at height 4. 4

%I #15 Dec 19 2015 13:11:26

%S 1,1,2,3,6,8,15,23,39,61,102,161,265,420,682,1087,1753,2790,4476,7120,

%T 11376,18075,28785,45666,72530,114882,182040,287878,455231,718755,

%U 1134491,1788461,2818140,4436000,6978932,10969695,17232572,27049320

%N Number of rooted trees with n nodes with every leaf at height 4.

%H Alois P. Heinz, <a href="/A048809/b048809.txt">Table of n, a(n) for n = 5..1000</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

%F Euler transform of A048808 shifted right.

%Y Cf. A048808-A048816.

%Y Column k=4 of A244925.

%K nonn

%O 5,3

%A _Christian G. Bower_, Apr 15 1999

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)