Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115106
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115106 Let M0 = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; M1 = {{1, 0, 1}, {2, 2, 0}, {0, 2, 2}}; M2 = {{2, 2, 0}, {0, 2, 2}, {1, 0, 1}}; M[n_] := M[n] = If[Mod[v[n][[1]], 3] == 0, M1, If[Mod[v[n][[2]], 3] == 0, M0, M2]] v[0] = {1, 1, 1}; M[0] = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; v[n_] := v[n] = M[n - 1].v[n - 1]. Then a(n) =v[n][[1]] +0
1
1, 4, 12, 20, 136, 392, 1408, 4544, 15040, 48896, 159232, 516608, 1675264, 5427200, 17575936, 56901632, 184188928, 596148224, 1929379840, 6244007936, 20206845952, 65392345088, 211617316864, 684814499840, 2216119238656 (list; graph; listen)
OFFSET

0,2

MATHEMATICA

M0 = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; M1 = {{1, 0, 1}, {2, 2, 0}, {0, 2, 2}}; M2 = {{2, 2, 0}, {0, 2, 2}, {1, 0, 1}}; M[n_] := M[n] = If[Mod[v[n][[1]], 3] == 0, M1, If[Mod[v[n][[2]], 3] == 0, M0, M2]] v[0] = {1, 1, 1}; M[0] = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; v[n_] := v[n] = M[n - 1].v[n - 1] a0 = Table[v[n][[1]], {n, 0, 25}]

CROSSREFS

Sequence in context: A008092 A087080 A134253 this_sequence A047965 A038430 A008167

Adjacent sequences: A115103 A115104 A115105 this_sequence A115107 A115108 A115109

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 03 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