login
A079777
a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) (mod n).
9
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, 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, 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
OFFSET
0,4
LINKS
Robert G. Wilson v, Table of n, a(n) for n = 0..10001 [a(9917) corrected by Georg Fischer, Dec 03 2023]
MATHEMATICA
l = {1, 1}; For[i = 3, i <= 100, i++, len = Length[l]; l = Append[l, Mod[l[[len]] + l[[len - 1]], i]]]; l
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 *)
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 *)
CROSSREFS
Sequence in context: A346275 A131900 A082116 * A224909 A227536 A047773
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Mar 08 2003
EXTENSIONS
Edited by Robert G. Wilson v, Dec 16 2007
STATUS
approved