login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152269 A switched hidden Markov recursion involving the matrices: M0 = {{0, 1}, {1, 1/2}}; M = {{0, 2}, {2, 1}}; as Mh=M0.M.(M0+I*mod[n.2]); v[(n)=Mh.v(n-1): first element of v. 0
0, 1, -3, -13, 15, 97, -171, -901, 1335, 7609, -12147, -66877, 103455, 577873, -905979, -5029429, 7840455, 43639081, -68193603, -379137133, 591862575, 3292136257, -5141508171, -28593069541, 44647143255, 248313707929 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Characteristic Polynomial is: 8 - 7 x + x^2.
Binary switching of the IdentityMatrix[2] uncovers opposite signed based on
A006131 with characteristic polynomial -4 - x + x^2
LINKS
FORMULA
M0 = {{0, 1}, {1, 1/2}}; M = {{0, 2}, {2, 1}};
as Mh=M0.M.(M0+I*mod[n.2]); v[(n)=Mh.v(n-1):
a(n) first element of -v(n)[[1]]/2.
a(n)=5*a(n-2)+32*a(n-4). G.f.: x(1+3x+8x^2)/(1-5x^2-32x^4). [From R. J. Mathar, Dec 04 2008]
MATHEMATICA
Clear[M, M0, Mh, v];
M0 = {{0, 1}, {1, 1/2}}; M = {{0, 2}, {2, 1}};
Mh[n_] := M0.(M.Inverse[Mod[n, 2]*IdentityMatrix[2] + M0]);
v[0] = {0, 1};
v[n_] := v[n] = Mh[n].v[n - 1]
Table[ -v[n][[1]]/2, {n, 0, 30}]
CROSSREFS
Sequence in context: A340018 A216044 A023144 * A063674 A273678 A022124
KEYWORD
sign,easy
AUTHOR
Roger L. Bagula, Dec 01 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 13:04 EDT 2024. Contains 371913 sequences. (Running on oeis4.)