|
|
A106603
|
|
a(n) = - 2*a(n-1) - 8*a(n-3), a(0) = 1, a(1) = 1, a(2) = -2.
|
|
2
|
|
|
1, 1, -2, -4, 0, 16, 0, 0, -128, 256, -512, 2048, -6144, 16384, -49152, 147456, -425984, 1245184, -3670016, 10747904, -31457280, 92274688, -270532608, 792723456, -2323644416, 6811549696, -19964887040, 58518929408, -171530256384, 502779609088, -1473710653440, 4319663357952
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Were only the first few terms of the sequence taken into account, it would appear that the sequence consists only of 0 and powers of 2. Upon dividing out the powers of 2 from each term of the sequence, one sees that, actually, a(n) = c(n)*d(n) with c = (1, 1, -1, -1, 0, 1, 0, 0, 1, 1, 1, 1, 3, 1, 3, 3, 13, 19, 7, 41, 15, 11, 129, 189, ...) and d = (2^0, 2^0, 2, 2^2, 0, 2^4, 0, 0, 2^7, 2^8, 2^9, 2^11, 2^11, 2^14, 2^14, 2^14, 2^15, 2^16, 2^19, 2^18, 2^21, 2^23, 2^21, 2^22, ...).
Floretion Algebra Multiplication Program, FAMP Code: 1basej[A*B] with A = + .5'i - .5'k + .5i' - .5k' - 2'jj' - .5'ij' - .5'ji' - .5'jk' - .5'kj' and B = + .5'i + .5'j + .5i' + .5j' + .5'kk' + .5'ij' + .5'ji' + .5e
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1 + 3*x)/(1 + 2*x + 8*x^3).
|
|
MATHEMATICA
|
LinearRecurrence[{-2, 0, -8}, {1, 1, -2}, 41] (* G. C. Greubel, Sep 08 2021 *)
|
|
PROG
|
(Magma) I:=[1, 1, -2]; [n le 3 select I[n] else (-2)*(Self(n-1) +4*Self(n-3)): n in [1..41]]; // G. C. Greubel, Sep 08 2021
(SageMath)
P.<x> = PowerSeriesRing(ZZ, prec)
return P( (1+3*x)/(1+2*x+8*x^3) ).list()
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|