cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A074045 Number of rooted trees of 2n+1 nodes with every leaf at height n.

Original entry on oeis.org

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
Offset: 0

Views

Author

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

Keywords

Crossrefs

Limit of A048808-A048815.
Cf. A244925.

Formula

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