OFFSET
2,2
COMMENTS
LINKS
E. A. Bender, E. R. Canfield and R. W. Robinson, The asymptotic number of tree-rooted maps on a surface, J. Comb. Theory, Ser. A, 48, No. 2 (1988), 156-164.
T. R. S. Walsh and A. B. Lehman, Counting rooted maps by genus. II, J. Comb. Theory, Ser. B, 13, No. 2 (1972), 122-141 (pp. 137, 140).
FORMULA
a(n) = binomial(2n, 0) C(0) b(n) + binomial(2n, 2) C(1) b(n-1) + binomial(2n, 4) C(2) b(n-2) + ... + binomial(2n, 2n) C(n) b(0), where C(n) = A000108(n) - n-th Catalan number and b(n) = (2n-1)!/(6(n-2)! (n-1)!) = A002802(n-2) - the number of toroidal one-vertex maps with n edges for n >= 2 and b(0) = b(1) = 0.
O.g.f.: x^2 * hypergeom([5/2, 5/2], [4], 16*x). - Mark van Hoeij, Apr 06 2013
D-finite with recurrence -(n+1)*(n-2)*a(n) +4*((2*n-1)^2)*a(n-1)=0. - R. J. Mathar, Jul 27 2022
From Vaclav Kotesovec, Feb 17 2024: (Start)
a(n) = n*(n-1) * binomial(2*n,n)^2 / (24*(n+1)).
a(n) ~ 2^(4*n-3)/(3*Pi). (End)
MATHEMATICA
HypergeometricPFQ[{5/2, 5/2}, {4}, 16x] + O[x]^18 // CoefficientList[#, x]& (* Jean-François Alcover, Aug 28 2019 *)
Table[n*(n-1) * Binomial[2*n, n]^2 / (24*(n+1)), {n, 2, 20}] (* Vaclav Kotesovec, Feb 17 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Valery A. Liskovets, May 04 2006
EXTENSIONS
Added more terms, Joerg Arndt, Apr 07 2013
STATUS
approved