Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147567 Switched cyclic vector Markov: M[0] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 1}}; M[1] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, -1, 0, 0}}; v(n)=M[Mod[n,2].v(n-1); a(n)=v(n)[[1]]. Characteristic Polynomials are: {-1 - x^3 + x^4, -1 + x + x^4}. +0
1
2, 1, 3, 4, 1, 2, -1, 3, -1, 1, -4, -1, -2, -1, -3, -4, -1, -2, 1, -3, 1, -1, 4, 1, 2, 1, 3, 4, 1, 2, -1, 3, -1, 1, -4, -1, -2, -1, -3, -4, -1, -2, 1, -3, 1, -1, 4, 1, 2, 1, 3, 4, 1, 2, -1, 3, -1, 1, -4, -1, -2, -1, -3, -4, -1, -2, 1, -3, 1, -1, 4, 1, 2, 1, 3, 4, 1, 2, -1, 3, -1, 1, -4, -1, -2 (list; graph; listen)
OFFSET

0,1

EXAMPLE

M[0] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 1}}; M[1] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, -1, 0, 0}}; v(n)=M[Mod[n,2].v(n-1); a(n)=v(n)[[1]].

MATHEMATICA

Clear[M, v, n]; M[0] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 1}}; M[1] = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, -1, 0, 0}}; v[0] = {2, 1, 3, 4}; v[n_] := v[n] = M[Mod[n, 2]].v[n - 1]; Table[v[n][[1]], {n, 0, 100}]

CROSSREFS

Sequence in context: A011358 A160188 A161224 this_sequence A084579 A059663 A027422

Adjacent sequences: A147564 A147565 A147566 this_sequence A147568 A147569 A147570

KEYWORD

sign

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 07 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research