login
This site is supported by donations 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
1, 1, 2, 3, 6, 8, 15, 23, 39, 61, 102, 161, 265, 420, 682, 1087, 1753, 2790, 4476, 7120, 11376, 18075, 28785, 45666, 72530, 114882, 182040, 287878, 455231, 718755, 1134491, 1788461, 2818140, 4436000, 6978932, 10969695, 17232572, 27049320 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 5..1000

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048808 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=4 of A244925.

Sequence in context: A319758 A129374 A209405 * A300671 A268645 A047001

Adjacent sequences:  A048806 A048807 A048808 * A048810 A048811 A048812

KEYWORD

nonn

AUTHOR

Christian G. Bower, Apr 15 1999

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 02:40 EST 2019. Contains 319365 sequences. (Running on oeis4.)