OFFSET
0,2
COMMENTS
Hankel transform is A168495(n+1).
FORMULA
G.f.: 1/(1-x-2x^2-x/(1-x/(1-x-2x^2-x/(1-x/(1-x-2x^2-x/(1-x/(1-x-2x^2-x/(1-x/(1-... (continued fraction);
a(n) = Sum_{k=0..n} A000108(k)*Sum_{j=0..n-k} C(k+j,k)*C(j,n-k-j)*2^(n-k-j).
D-finite with recurrence: (n+1)*a(n) +2*(1-3n)*a(n-1) +(n-1)*a(n-2) +4*(3n-5)*a(n-3) +4*(n-3)*a(n-4)= 0. - R. J. Mathar, Nov 17 2011
MAPLE
with(LREtools): with(FormalPowerSeries): # requires Maple 2022
ogf:= (1/(1-x-2*x^2))*(1 - sqrt(1 - 4*(x/(1-x-2*x^2)))) / (2*(x/(1-x-2*x^2))):
init:= [1, 2, 7, 23, 85, 332, 1369];
iseq:= seq(u(i-1)=init[i], i=1..nops(init)): req:= FindRE(ogf, x, u(n));
rmin:= subs(n=n-4, MinimalRecurrence(req, u(n), {iseq})[1]); # Mathar's recurrence
a:= gfun:-rectoproc({rmin, iseq}, u(n), remember):
seq(a(n), n=0..30); # Georg Fischer, Nov 04 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul Barry, Jan 08 2011
STATUS
approved