|
|
A158761
|
|
a(n)=a(n-2)+64*a(n-3) with a(0)=1, a(1)=4, a(3)=16.
|
|
0
|
|
|
1, 4, 16, 68, 272, 1092, 4624, 18500, 74512, 314436, 1258512, 5083204, 21382416, 85627972, 346707472, 1454102596, 5826897680, 23643380804, 98889463824, 396564832324, 1612065835280, 6725490517060, 26992215104016
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The sequence is also 2^n times the sum of the three top-row entries
of the n-th power of the matrix (0,2,0; 0,0,2;, 2,1/8,0) .
|
|
LINKS
|
|
|
FORMULA
|
G.f.: -(1+4*x+15*x^2)/(-1+x^2+64*x^3). [From R. J. Mathar, Mar 26 2009]
|
|
MATHEMATICA
|
Clear[M, v, t, n];
M = {{0, t, 0}, {0, 0, t}, {t, 1/t^3, 0}};
v[0] = {1, 1, 1};
v[n_] := v[n] = M.v[n - 1];
CharacteristicPolynomial[M, x];
t = 2; a = Table[t^n*v[n][[1]], {n, 0, 30}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Definition replaced by recurrence - The Associate Editors of the OEIS - Oct 05 2009
|
|
STATUS
|
approved
|
|
|
|