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.

A245103 Number of (2n+1)-node rooted trees of height n.

Original entry on oeis.org

1, 1, 4, 18, 93, 498, 2744, 15349, 86802, 494769, 2837412, 16351036, 94599339, 549118128, 3196397701, 18651028188, 109057492901, 638863803720, 3748605725140, 22027421351633, 129606128716906, 763484925360476, 4502370205339221, 26577052185126059
Offset: 0

Views

Author

Alois P. Heinz, Jul 11 2014

Keywords

Crossrefs

Cf. A034781.

Formula

a(n) = A034781(2n+1,n).
a(n) ~ c * d^n / sqrt(n), where d = 6.0313827950978605329935... (same as for A245102 and A339440), c = 0.14566140512597547487... . - Vaclav Kotesovec, Jul 12 2014