OFFSET
0,3
COMMENTS
Hankel transform is A094967(n+1) (F(2n+1) repeated).
FORMULA
a(n)=sum{k=0..n, sum{j=0..n, binomial(k-j,n-k-j)*binomial(k,j)*if(n-k-j>=0, A000108(n-k-j),0)}}
Conjecture: (n+2)*a(n) +2*(-n-1)*a(n-1) +(-5*n+4)*a(n-2) +2*(3*n-4)*a(n-3) +5*(n-2)*a(n-4)=0. - R. J. Mathar, Nov 07 2014
a(n) ~ 21^(1/4) * ((1+sqrt(21))/2)^(n + 5/2) / (8 * sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Oct 30 2017
MATHEMATICA
Table[Sum[Sum[Binomial[k-j, n-k-j] * Binomial[k, j] * If[n-k-j>=0, CatalanNumber[n-k-j], 0], {j, 0, n}], {k, 0, n}], {n, 0, 30}] (* Vaclav Kotesovec, Oct 30 2017 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Barry, Feb 18 2011
STATUS
approved