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!)
A088523 a(1) = 2; for n > 1, a(n) = (a(n-1) + prime(n)) mod n. 2
2, 1, 0, 3, 4, 5, 1, 4, 0, 9, 7, 8, 10, 11, 13, 2, 10, 17, 8, 19, 8, 21, 12, 5, 2, 25, 20, 15, 8, 1, 4, 7, 12, 15, 24, 31, 3, 14, 25, 38, 12, 25, 1, 18, 35, 4, 27, 10, 41, 20, 49, 28, 4, 39, 21, 4, 45, 26, 8, 49, 27, 10, 2, 57, 45, 32, 28, 25, 27, 26, 24, 23, 25, 28, 32, 35, 39, 46, 52, 61 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MATHEMATICA

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

CROSSREFS

Cf. A088521, A088522, A006257.

Sequence in context: A221463 A135488 A099493 * A222211 A145460 A292978

Adjacent sequences:  A088520 A088521 A088522 * A088524 A088525 A088526

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 September 19 14:36 EDT 2020. Contains 337178 sequences. (Running on oeis4.)