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

%I

%S 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,

%T 12,39,67,96,13,44,76,109,4,39,75,112,150,22,62,103,145,188,39,84,130,

%U 177,2,51,101,152,204,16,70,125,181,238,25,84,144,205,267,23,87,152,218,285

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

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

%Y Cf. A088521, A088523, A006257.

%K nonn,easy

%O 1,1

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

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

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 28 05:33 EDT 2020. Contains 337392 sequences. (Running on oeis4.)