OFFSET
0,2
LINKS
Markus Kuba and Alois Panholzer, Combinatorial families of multilabelled increasing trees and hook-length formulas, arXiv:1411.4587 [math.CO], 2014. See p. 18
FORMULA
Kuba et al. (2014) gives a recurrence (see Theorem 7).
a(n) = A258659(2*n). - Michael Somos, Jun 17 2017
MAPLE
A261000aer := proc(n)
option remember;
local a, nloc, j, k, l;
if n = 1 then
1;
else
nloc := n-2 ;
a :=0 ;
for j from 0 to nloc-1 do
for k from 0 to nloc-1-j do
l := nloc-1-j-k ;
if l >= 0 then
a := a+procname(j+1)*procname(k+1)*procname(l+1) * (2*nloc+1)!/(2*j+1)!/(2*k+1)!/(2*l+1)! ;
end if;
end do:
end do:
%/2 ;
end if;
end proc:
A261000 := proc(n)
A261000aer(2*n+1) ;
end proc:
seq(A261000(n), n=0..15) ; # R. J. Mathar, Aug 18 2015
MATHEMATICA
terms = 12; nmax = 4 terms; A = 1; Do[A = Exp[Integrate[A^(1/2)*Integrate[1/A^(3/2), x], x] + O[x]^nmax], nmax]; A258659 = CoefficientList[A, x^2]*Range[0, nmax - 2, 2]!;
a[n_] := A258659[[2 n + 1]];
Table[a[n], {n, 0, terms - 1}] (* Jean-François Alcover, Nov 27 2017 *)
a[ n_] := If[ n<0, 0, (-1)^n * (4*n+1)! * SeriesCoefficient[ JacobiSD[x, 1/2], {x, 0, 4*n+1}]]; (* Michael Somos, Sep 03 2022 *)
a[ n_] := If[ n<0, 0, (-1)^n * (4*n+1)! * SeriesCoefficient[ x*Sqrt[1/x^2 / WeierstrassP[x, {1, 0}]], {x, 0, 4*n+1}]]; (* Michael Somos, Jul 02 2024 *)
a[ n_] := If[ n<0, 0, (-1)^n * (4*n+1)! * SeriesCoefficient[
InverseSeries[ Series[ x * Hypergeometric2F1[1/4, 1/2, 5/4, x^4/4], {x, 0, 4*n+1}]], {x, 0, 4*n+1}]]; (* Michael Somos, Jul 02 2024 *)
PROG
(PARI) {a(n) = if( n<0, 0, my(m = 4*n + 1); m! * polcoeff( serreverse( intformal( 1 / sqrt(1 + x^4/4 + x * O(x^m)) ) ), m))}; /* Michael Somos, Jun 17 2017 */
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 09 2015
STATUS
approved