%I #10 Nov 10 2014 10:43:57

%S 1,0,3,0,5,11,1,9,18,28,8,20,33,4,19,35,52,9,28,48,69,12,35,59,84,9,

%T 36,64,93,10,41,73,106,1,36,72,109,147,19,59,100,142,185,36,81,127,

%U 174,222,44,94,145,197,9,63,118,174,231,18,77,137,198,260,16,80,145,211,278,9

%N a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).

%H Harvey P. Dale, <a href="/A088521/b088521.txt">Table of n, a(n) for n = 1..1000</a>

%t a[1] = 1; a[n_] := a[n] = Mod[a[n - 1] + n, Prime[n]]; Table[ a[n], {n, 69}]

%t RecurrenceTable[{a[1]==1,a[n]==Mod[a[n-1]+n,Prime[n]]},a,{n,70}] (* _Harvey P. Dale_, Nov 10 2014 *)

%Y Cf. A088522, A088523, A006257.

%K nonn,easy

%O 1,3

%A _N. J. A. Sloane_, Nov 14 2003

%E More terms from _Robert G. Wilson v_ and _Ray Chandler_, Nov 15 2003