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.

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

Original entry on oeis.org

1, 0, 0, 2, 12, 61, 301, 1460, 7019, 33628, 160934, 770109, 3686706, 17661288, 84675601, 406319271, 1951428049, 9380072046, 45124798445, 217252113080, 1046731684143, 5046754081095, 24348794377704, 117547968556766, 567818803946292, 2744396907325759
Offset: 0

Views

Author

Alois P. Heinz, Jul 11 2014

Keywords

Crossrefs

Cf. A227819.

Formula

a(n) = A227819(2n+1,n).
a(n) ~ c * d^n / sqrt(n), where d = 4.9159375028212... (same as for A245090), c = 0.076188269997... . - Vaclav Kotesovec, Jul 12 2014