OFFSET
1,4
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..1000
Paul Barry, Generalized Catalan recurrences, Riordan arrays, elliptic curves, and orthogonal polynomials, arXiv:1910.00875 [math.CO], 2019.
FORMULA
Conjecture: n*a(n) +(n+1)*a(n-1) +10*(-2*n+5)*a(n-2) +2*(2*n-9)*a(n-3) +2*(12*n-67)*a(n-4) +20*(n-7)*a(n-5)=0. - R. J. Mathar, Nov 21 2014
G.f.: 1/2 - sqrt(4*x^4+4*x^3-4*x+1)/2. - Vaclav Kotesovec, Jan 25 2015
Recurrence: n*a(n) = 2*(2*n-3)*a(n-1) - 2*(2*n-9)*a(n-3) - 4*(n-6)*a(n-4). - Vaclav Kotesovec, Jan 25 2015
MATHEMATICA
nmax = 30; aa = ConstantArray[0, nmax]; aa[[1]] = 1; aa[[2]] = 1; aa[[3]] = 1; aa[[4]] = 2; Do[aa[[n]] = Sum[aa[[k]]*aa[[n-k]], {k, 1, n-1}], {n, 5, nmax}]; aa (* Vaclav Kotesovec, Jan 25 2015 *)
Rest@ CoefficientList[Series[1/2 - Sqrt[4 x^4 + 4 x^3 - 4 x + 1]/2, {x, 0, 28}], x] (* Michael De Vlieger, Jan 02 2020 *)
PROG
(Magma) a:=[1, 1, 1, 2]; for n in [5..30] do Append(~a, &+[a[k]*a[n-k]:k in [1..n-1]] ); end for; a; // Marius A. Burtea, Jan 02 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved