|
|
A060925
|
|
a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.
|
|
12
|
|
|
1, 4, 11, 34, 101, 304, 911, 2734, 8201, 24604, 73811, 221434, 664301, 1992904, 5978711, 17936134, 53808401, 161425204, 484275611, 1452826834, 4358480501, 13075441504, 39226324511, 117678973534, 353036920601
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=-1, A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n-1)=charpoly(A,2). - Milan Janjic, Jan 26 2010
|
|
LINKS
|
|
|
FORMULA
|
Row sums of Lucas convolution triangle A060922.
a(n) = (5*3^n - (-1)^n)/4.
G.f.: (1+2*x)/(1 - 2*x - 3*x^2).
|
|
MAPLE
|
|
|
MATHEMATICA
|
LinearRecurrence[{2, 3}, {1, 4}, 30] (* Harvey P. Dale, Mar 07 2014 *)
|
|
PROG
|
(PARI) {a(n) = (5*3^n - (-1)^n)/4};
(Magma) [(5*3^n - (-1)^n)/4: n in [0..30]]; // G. C. Greubel, Apr 06 2021
(Sage) [(5*3^n - (-1)^n)/4 for n in (0..30)] # G. C. Greubel, Apr 06 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|