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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152305 Marsaglia-Zaman type recursive sequence: f(x)=f(x - 2) + f(x - 3) + Floor[f(x - 1)/10]; a(n)=Mod[f(n),10]. 0
1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 2, 7, 2, 1, 2, 7, 8, 6, 5, 8, 0, 0, 5, 0, 4, 9, 2, 9, 1, 0, 0, 6, 0, 5, 6, 1, 5, 7, 7, 4, 5, 9, 2, 7, 8, 0, 2, 6, 9, 0, 6, 1, 4, 4, 7, 4, 3, 5, 2, 2, 1, 0, 8, 3, 2, 8, 0, 7, 9, 4, 2, 0, 8, 7, 2, 4, 2, 6, 9, 9, 9, 0, 6, 2, 6, 5, 6, 8, 3, 7, 9, 4, 9, 6, 4, 1, 7, 9, 7, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

REFERENCES

Ivars Peterson, The Jungles of Randomness, 1998, John Wiley and Sons, Inc., page 207

LINKS

Table of n, a(n) for n=0..100.

FORMULA

f(x)=f(x - 2) + f(x - 3) + Floor[f(x - 1)/10];

a(n)=Mod[f(n),10].

MATHEMATICA

f[0] = f[1] = f[2] = 1;

f[x_] := f[x] = f[x - 2] + f[x - 3] + Floor[f[x - 1]/10];

Table[Mod[f[n], 10], {n, 0, 100}]

CROSSREFS

Sequence in context: A316202 A326671 A134727 * A131419 A317177 A326491

Adjacent sequences:  A152302 A152303 A152304 * A152306 A152307 A152308

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 10:52 EDT 2021. Contains 348150 sequences. (Running on oeis4.)