A152302 - OEIS

A152302

Marsaglia-Zaman type recursive sequence: f(x)=f(x - 1) + f(x - 2) + Floor[f(x - 1)/10]; a(n)=Mod[f(n),10].

1, 1, 1, 1, 2, 3, 4, 5, 7, 1, 6, 3, 3, 8, 0, 2, 8, 5, 3, 6, 4, 6, 6, 8, 3, 3, 3, 8, 0, 8, 6, 8, 9, 9, 9, 4, 3, 8, 9, 3, 3, 9, 7, 8, 1, 6, 1, 6, 5, 0, 8, 4, 5, 8, 0, 4, 0, 1, 8, 4, 2, 4, 0, 7, 1, 5, 2, 5, 8, 2, 4, 7, 6, 2, 3, 2, 2, 0, 8, 2, 0, 0, 1, 7, 7, 0, 3, 4, 7, 3, 0, 2, 3, 5, 1, 0, 6, 5, 1, 3, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

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 - 1) + f(x - 2) + Floor[f(x - 1)/10];

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

MATHEMATICA

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