|
Search: id:A152303
|
|
|
| A152303 |
|
Marsaglia-Zaman type recursive sequence as a vector Markov: M = {{0, 1}, {1, 1}}; M1 = {{0, 0}, {1/10, 0}}; v(n)=M.v(n-1)+Floor[M1.v(n-1),10] a(n)=Mod[v(n)[[1]],10]. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 8, 3, 1, 5, 8, 6, 9, 4, 8, 8, 9, 9, 8, 7, 8, 9, 8, 8, 1, 9, 1, 4, 4, 0, 7, 0, 6, 2, 6, 0, 8, 4, 4, 1, 9, 9, 8, 9, 3, 0, 6, 8, 0, 6, 4, 6, 5, 2, 4, 9, 3, 3, 0, 0, 9, 6, 6, 5, 9, 6, 5, 4, 3, 7, 1, 6, 3, 3, 0, 0, 2, 4, 4, 4, 3, 7, 7, 4, 7, 0, 4, 5, 9, 0, 0, 2, 1, 0, 7, 0, 5, 6, 9, 5, 1, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Ivars Peterson, The Jungles of Randomness, 1998, John Wiley and Sons, Inc., page 207
|
|
FORMULA
|
M = {{0, 1}, {1, 1}}; M1 = {{0, 0}, {1/10, 0}};
v(n)=M.v(n-1)+Floor[M1.v(n-1),10];
a(n)=Mod[v(n)[[1]],10].
|
|
MATHEMATICA
|
Clear[M, M1, v, n];
M = {{0, 1}, {1, 1}}; M1 = {{0, 0}, {1/10, 0}};
v[0] = {1, 1};
v[n_] := v[n] = M.v[n - 1] + Floor[M1.v[n - 1]];
Table[v[n][[1]], {n, 0, 100}]
Table[Mod[v[n][[1]], 10], {n, 0, 100}]
|
|
CROSSREFS
|
Sequence in context: A096320 A105955 A003893 this_sequence A064737 A098906 A007887
Adjacent sequences: A152300 A152301 A152302 this_sequence A152304 A152305 A152306
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 02 2008
|
|
|
Search completed in 0.002 seconds
|
