login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088522 a(1) = 2; for n > 1, a(n) = (a(n-1) + n) mod prime(n). 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..67.

MATHEMATICA

a[1] = 2; a[n_] := a[n] = Mod[a[n - 1] + n, Prime[n]]; Table[ a[n], {n, 67}]

CROSSREFS

Cf. A088521, A088523, A006257.

Sequence in context: A239093 A263453 A108952 * A252751 A199744 A115124

Adjacent sequences:  A088519 A088520 A088521 * A088523 A088524 A088525

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 07:04 EDT 2020. Contains 336477 sequences. (Running on oeis4.)