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.

A245090 Number of 2n-node rooted identity trees of height n.

Original entry on oeis.org

0, 1, 1, 2, 8, 34, 149, 672, 3078, 14232, 66278, 310408, 1460390, 6896417, 32668860, 155166468, 738679240, 3523549192, 16837094932, 80580576022, 386187326865, 1853144445292, 8902504243912, 42811658101548, 206072505914938, 992778384676916, 4786621055083592
Offset: 0

Views

Author

Alois P. Heinz, Jul 11 2014

Keywords

Crossrefs

Cf. A227819.

Formula

a(n) = A227819(2n,n).
a(n) ~ c * d^n / sqrt(n), where d = 4.9159375028212..., c = 0.025641919495... . - Vaclav Kotesovec, Jul 12 2014