OFFSET
0,2
COMMENTS
Has a square root singularity.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..330
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 669.
FORMULA
D-finite with recurrence: a(1)=2, a(n+1) = 4*(2*n -1)*a(n).
a(n) = (1/4)*8^n*Gamma(n-1/2)/Pi^(1/2) for n>0.
a(n+1) = ((2*n)!/n!)*2^(n+1). - Zerinvary Lajos, Sep 25 2006
a(n) = n!*A025225(n). - R. J. Mathar, Oct 18 2013
G.f.: (1- 2F0([1,-1/2], [], 8*x))/2. - R. J. Mathar, Jan 25 2020
a(n) ~ 2^(3*n-3/2) * n^(n-1) / exp(n). - Amiram Eldar, Oct 05 2025
MAPLE
spec := [S, {C=Union(B, Z), B=Prod(S, S), S=Union(Z, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
MATHEMATICA
Table[n!*2^n*CatalanNumber[n-1] + Boole[n==0], {n, 0, 30}] (* G. C. Greubel, May 29 2022 *)
PROG
(SageMath) [2^n*factorial(n)*catalan_number(n-1) + bool(n==0)/2 for n in (0..30)] # G. C. Greubel, May 29 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
INRIA Encyclopedia of Combinatorial Structures, Jan 25 2000
STATUS
approved
