login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048810 Number of rooted trees with n nodes with every leaf at height 5. 3
1, 1, 2, 3, 6, 9, 16, 26, 44, 73, 123, 203, 340, 563, 935, 1550, 2571, 4251, 7034, 11618, 19188, 31654, 52201, 85999, 141631, 233074, 383375, 630215, 1035508, 1700501, 2791309, 4579587, 7510280, 12310980, 20172075, 33039130, 54092556 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,3

LINKS

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

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048809 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=5 of A244925.

Sequence in context: A093830 A320268 A118033 * A017915 A114702 A026768

Adjacent sequences:  A048807 A048808 A048809 * A048811 A048812 A048813

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 20 04:14 EST 2019. Contains 319323 sequences. (Running on oeis4.)