Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116561
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116561 Sequentually switched Markov of six determinant one matrices. +0
1
0, 1, 4, 4, 18, 7, 7, 18, 79, 79, 359, 140, 140, 359, 1576, 1576, 7162, 2793, 2793, 7162, 31441, 31441, 142881, 55720, 55720, 142881, 627244, 627244, 2850458, 1111607, 1111607, 2850458, 12513439, 12513439, 56866279, 22176420, 22176420 (list; graph; listen)
OFFSET

0,3

FORMULA

M1 = {{1, 0}, {0, 1}}; M2 = {{0, 1}, {-1, 2}}; M3 = {{2, 1}, {-1, 0}}; M4 = {{1, 0}, {2, 1}}; M5 = {{1, 2}, {0, 1}}; M6 = {{0, 1}, {-1, 0}}; M[n_] = If[Mod[n, 6] == 0, M1, If[Mod[n, 6] == 1, M2, If[Mod[n, 6] == 2, M3, If[Mod[n, 6] == 3, M4, If[Mod[n, 6] == 4, M5, M6]]]]]; v[0] = {0, 1}; v[n_] := v[n] = M[n].v[n - 1] a(n) = Ans[v[n][[1]]]

MATHEMATICA

M1 = {{1, 0}, {0, 1}}; M2 = {{0, 1}, {-1, 2}}; M3 = {{2, 1}, {-1, 0}}; M4 = {{1, 0}, {2, 1}}; M5 = {{1, 2}, {0, 1}}; M6 = {{0, 1}, {-1, 0}}; M[n_] = If[Mod[n, 6] == 0, M1, If[Mod[n, 6] == 1, M2, If[Mod[n, 6] == 2, M3, If[Mod[n, 6] == 3, M4, If[Mod[n, 6] == 4, M5, M6]]]]]; v[0] = {0, 1}; v[n_] := v[n] = M[n].v[n - 1] a = Table[Abs[v[n][[1]]], {n, 0, 36}]

CROSSREFS

Sequence in context: A117785 A117787 A113727 this_sequence A086448 A128090 A119948

Adjacent sequences: A116558 A116559 A116560 this_sequence A116562 A116563 A116564

KEYWORD

nonn,uned,probation,obsc

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 17 2006

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research