The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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, 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; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES Ivars Peterson, The Jungles of Randomness, 1998, John Wiley and Sons, Inc., page 207 LINKS 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 * A064737 A246558 A307638 Adjacent sequences:  A152300 A152301 A152302 * A152304 A152305 A152306 KEYWORD nonn AUTHOR Roger L. Bagula, Dec 02 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 21:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)