login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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)
FORMULA
a(n) = A244925(2n+1,n).
CROSSREFS
Limit of A048808-A048815.
Cf. A244925.
Sequence in context: A048813 A048814 A048815 * A073776 A129853 A095982
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)