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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #2 Mar 30 2012 17:34:28
%S 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,
%T 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,
%U 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
%N Marsaglia-Zaman type recursive sequence: f(x)=f(x - 1) + f(x - 2) + Floor[f(x - 1)/10]; a(n)=Mod[f(n),10].
%D Ivars Peterson, The Jungles of Randomness, 1998, John Wiley and Sons, Inc., page 207
%F f(x)=f(x - 1) + f(x - 2) + Floor[f(x - 1)/10];
%F a(n)=Mod[f(n),10].
%t f[0] = f[1] = 1; f[x_] := f[x] = f[x - 1] + f[x - 2] + Floor[f[x - 1]/10];
%t Table[Mod[f[n], 10], {n, 0, 100}]
%K nonn
%O 0,5
%A _Roger L. Bagula_, Dec 02 2008