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. 2
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; internal format)
OFFSET

5,3

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048808 shifted right.

CROSSREFS

Cf. A048808-A048816.

Sequence in context: A075723 A138137 A129374 * A047001 A174021 A091070

Adjacent sequences:  A048806 A048807 A048808 * A048810 A048811 A048812

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Apr 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:45 EST 2012. Contains 205860 sequences.