login
A088522
a(1) = 2; for n > 1, a(n) = (a(n-1) + n) mod prime(n).
3
2, 1, 4, 1, 6, 12, 2, 10, 19, 0, 11, 23, 36, 7, 22, 38, 55, 12, 31, 51, 72, 15, 38, 62, 87, 12, 39, 67, 96, 13, 44, 76, 109, 4, 39, 75, 112, 150, 22, 62, 103, 145, 188, 39, 84, 130, 177, 2, 51, 101, 152, 204, 16, 70, 125, 181, 238, 25, 84, 144, 205, 267, 23, 87, 152, 218, 285
OFFSET
1,1
LINKS
MATHEMATICA
a[1] = 2; a[n_] := a[n] = Mod[a[n - 1] + n, Prime[n]]; Table[ a[n], {n, 67}]
nxt[{n_, a_}]:={n+1, Mod[a+n+1, Prime[n+1]]}; NestList[nxt, {1, 2}, 70][[;; , 2]] (* Harvey P. Dale, Jul 19 2023 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 14 2003
EXTENSIONS
More terms from Robert G. Wilson v and Ray Chandler, Nov 15 2003
STATUS
approved