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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004650 Prime(n) mod (n+1). 2
0, 0, 1, 2, 5, 6, 1, 1, 3, 7, 7, 11, 13, 13, 15, 2, 5, 4, 7, 8, 7, 10, 11, 14, 19, 20, 19, 20, 19, 20, 31, 32, 1, 34, 5, 3, 5, 7, 7, 9, 11, 9, 15, 13, 13, 11, 19, 27, 27, 25, 25, 27, 25, 31, 33, 35, 37, 35, 37, 37, 35, 41, 51, 51, 49, 49, 59, 61, 67, 65, 65, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

MATHEMATICA

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

PROG

(PARI) a(n) = prime(n) % (n+1) \\ Michel Marcus, Jun 12 2013

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

CROSSREFS

Sequence in context: A196550 A011037 A111987 * A138279 A131800 A086038

Adjacent sequences:  A004647 A004648 A004649 * A004651 A004652 A004653

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, wild(AT)edumath.u-strasbg.fr (Daniel Wild)

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 January 23 19:36 EST 2020. Contains 331175 sequences. (Running on oeis4.)