The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A115106

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

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]]
(history; published version)

#3 by Charles R Greathouse IV at Wed Mar 12 16:36:50 EDT 2014

AUTHOR

_Roger L. Bagula_, Mar 03 2006

Discussion

Wed Mar 12

16:36

OEIS Server: https://oeis.org/edit/global/2126

#2 by Russ Cox at Fri Mar 30 18:49:15 EDT 2012

AUTHOR

_Roger Bagula (rlbagulatftn(AT)yahoo.com), _, Mar 03 2006

Discussion

Fri Mar 30

18:49

OEIS Server: https://oeis.org/edit/global/236

#1 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

NAME

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]]

DATA

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

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}]

KEYWORD

nonn

AUTHOR

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

STATUS

approved