|
%I #18 Dec 03 2023 14:29:10
%S 0,1,1,2,3,0,3,3,6,0,6,6,0,6,6,12,2,14,16,11,7,18,3,21,0,21,21,15,8,
%T 23,1,24,25,16,7,23,30,16,8,24,32,15,5,20,25,0,25,25,2,27,29,5,34,39,
%U 19,3,22,25,47,13,0,13,13,26,39,0,39,39,10,49,59,37,24,61,11,72,7,2,9,11,20
%N a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) (mod n).
%H Robert G. Wilson v, <a href="/A079777/b079777.txt">Table of n, a(n) for n = 0..10001</a> [a(9917) corrected by _Georg Fischer_, Dec 03 2023]
%t l = {1, 1}; For[i = 3, i <= 100, i++, len = Length[l]; l = Append[l, Mod[l[[len]] + l[[len - 1]], i]]]; l
%t f[s_] := f[s] = Append[s, Mod[s[[ -2]] + s[[ -1]], Length[s]]]; Nest[f, {0, 1}, 80] (* _Robert G. Wilson v_, Dec 16 2007 *)
%t RecurrenceTable[{a[0]==0,a[1]==1,a[n]==Mod[a[n-1]+a[n-2],n]},a,{n,80}] (* _Harvey P. Dale_, Nov 29 2019 *)
%Y Cf. A000045, A058981, A096534, A096535, Zeros in A073853.
%K nonn
%O 0,4
%A _Joseph L. Pe_, Mar 08 2003
%E Edited by _Robert G. Wilson v_, Dec 16 2007
|
