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!)
A096197 a(n) = (1+prime(n)) mod n. 1
0, 0, 0, 0, 2, 2, 4, 4, 6, 0, 10, 2, 3, 2, 3, 6, 9, 8, 11, 12, 11, 14, 15, 18, 23, 24, 23, 24, 23, 24, 4, 4, 6, 4, 10, 8, 10, 12, 12, 14, 16, 14, 20, 18, 18, 16, 24, 32, 32, 30, 30, 32, 30, 36, 38, 40, 42, 40, 42, 42, 40, 46, 56, 56, 54, 54, 64, 66, 3, 0, 70, 0, 3, 4, 5, 4, 5, 8, 7, 10, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Graph is similar to that of A004648.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

MATHEMATICA

Table[Mod[Prime[n] + 1, n], {n, 100}] (* Vincenzo Librandi, Sep 11 2014 *)

PROG

(MAGMA) [(NthPrime(n)+1) mod(n): n in [1..90]]; // Vincenzo Librandi, Sep 11 2014

(PARI) lista(nn) = {forprime(p=2, n, print1((p+1) % primepi(p), ", "); ); } \\ Michel Marcus, Sep 11 2014

CROSSREFS

Cf. A082495, A006521, A087611, A004648.

Sequence in context: A277758 A240027 A203555 * A097264 A339810 A324104

Adjacent sequences:  A096194 A096195 A096196 * A096198 A096199 A096200

KEYWORD

nonn,easy

AUTHOR

Labos Elemer, Jul 26 2004

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 June 13 05:41 EDT 2021. Contains 344981 sequences. (Running on oeis4.)