|
|
A152601
|
|
a(n) = Sum_{k=0..n} C(n+k,2k)*A000108(k)*3^k*2^(n-k).
|
|
4
|
|
|
1, 5, 40, 395, 4360, 51530, 637840, 8163095, 107140360, 1434252230, 19507077040, 268796321870, 3744480010960, 52647783144980, 746145741252640, 10648007952942095, 152877753577617160, 2206713692628578030
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Hankel transform is 15^C(n+1,2).
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 1/(1-5x/(1-3x/(1-5x/(1-3x/(1-5x/(1-3x/(1-5x/(1-... (continued fraction). - Philippe Deléham, Nov 28 2011
Conjecture: (n+1)*a(n) +8*(-2*n+1)*a(n-1) +4*(n-2)*a(n-2)=0. - R. J. Mathar, Nov 24 2012
G.f.: 1/G(x), with G(x) = 1-2*x-(3*x)/G(x) (continued fraction). - Nikolaos Pantelidis, Jan 09 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|