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!)
A048815 Number of rooted trees with n nodes with every leaf at height 10. 4
1, 1, 2, 3, 6, 9, 17, 28, 49, 83, 145, 245, 425, 724, 1246, 2130, 3659, 6254, 10724, 18335, 31396, 53676, 91832, 156944, 268324, 458435, 783324, 1337862, 2284950, 3901211, 6660304, 11367935, 19401130, 33104598, 56481086, 96349147 (list; graph; refs; listen; history; text; internal format)
OFFSET

11,3

LINKS

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

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048814 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=10 of A244925.

Sequence in context: A048812 A048813 A048814 * A074045 A073776 A129853

Adjacent sequences:  A048812 A048813 A048814 * A048816 A048817 A048818

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 18 23:05 EST 2019. Contains 319282 sequences. (Running on oeis4.)