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.

A047009 T(2n,n), array T given by A047000.

Original entry on oeis.org

1, 2, 4, 14, 60, 286, 1456, 7752, 42636, 240350, 1381380, 8064030, 47682960, 284997384, 1719031840, 10450528048, 63967345068, 393895175646, 2438398706380, 15166284983850, 94730949283740, 593966352738990
Offset: 0

Views

Author

Keywords

Comments

Also: number of nonseparable planar rooted maps with n edges. - R. J. Mathar, Aug 18 2006

Formula

a(n) = 2*A006013(n-1) = 2*(3n-2)!/(n!*(2*n-1)!). - R. J. Mathar, Aug 18 2006
G.f.: 1+2*g where g*(1-g)^2 = x. - Mark van Hoeij, Nov 10 2011