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.

A245102 Number of 2n-node rooted trees of height n.

Original entry on oeis.org

0, 1, 2, 8, 36, 180, 941, 5079, 27961, 156129, 880883, 5009625, 28668920, 164897622, 952418882, 5520254925, 32090787577, 187030223470, 1092467751427, 6393706661582, 37484034980109, 220093799592140, 1294100839792723, 7618482099893824, 44901233075819275
Offset: 0

Views

Author

Alois P. Heinz, Jul 11 2014

Keywords

Crossrefs

Cf. A034781.

Formula

a(n) = A034781(2n,n).
a(n) ~ c * d^n / sqrt(n), where d = 6.0313827950978605329935..., c = 0.03944957121899527... . - Vaclav Kotesovec, Jul 12 2014