A004650 a(n) = prime(n) mod (n+1).

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

Offset: 1

Author

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

Keywords

• nonn
• easy

Links

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

Crossrefs

Cf. A004648, A004649.

Programs

Magma

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

Mathematica

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

PARI

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