

A088521


a(1) = 1; for n > 1, a(n) = (a(n1) + n) mod prime(n).


3



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, 36, 64, 93, 10, 41, 73, 106, 1, 36, 72, 109, 147, 19, 59, 100, 142, 185, 36, 81, 127, 174, 222, 44, 94, 145, 197, 9, 63, 118, 174, 231, 18, 77, 137, 198, 260, 16, 80, 145, 211, 278, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000


MATHEMATICA

a[1] = 1; a[n_] := a[n] = Mod[a[n  1] + n, Prime[n]]; Table[ a[n], {n, 69}]
RecurrenceTable[{a[1]==1, a[n]==Mod[a[n1]+n, Prime[n]]}, a, {n, 70}] (* Harvey P. Dale, Nov 10 2014 *)


CROSSREFS

Cf. A088522, A088523, A006257.
Sequence in context: A076296 A260934 A143280 * A022837 A225950 A088969
Adjacent sequences: A088518 A088519 A088520 * A088522 A088523 A088524


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



