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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074045 Number of rooted trees of 2n+1 nodes with every leaf at height n. 2
1, 1, 2, 3, 6, 9, 17, 28, 49, 83, 145, 246, 427, 729, 1256, 2152, 3702, 6341, 10892, 18662, 32016, 54853, 94034, 161055, 275929, 472461, 809033, 1384848, 2370434, 4056309, 6940744, 11873769, 20311018, 34737781, 59405959, 101577454, 173669088, 296890268 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..3500 (terms 0..250 from Alois P. Heinz)

Index entries for sequences related to rooted trees

FORMULA

a(n) = A244925(2n+1,n).

CROSSREFS

Limit of A048808-A048815.

Cf. A244925.

Sequence in context: A048813 A048814 A048815 * A073776 A129853 A095982

Adjacent sequences:  A074042 A074043 A074044 * A074046 A074047 A074048

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower, Aug 13 2002. Suggested by Paul D. Hanna

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 December 15 09:05 EST 2019. Contains 329995 sequences. (Running on oeis4.)