A022463 a(n) = prime(n^2) mod prime(n).

0, 1, 3, 4, 9, 8, 6, 7, 5, 19, 10, 13, 25, 32, 17, 29, 50, 8, 25, 43, 17, 64, 68, 28, 78, 1, 60, 15, 50, 104, 80, 39, 106, 28, 97, 57, 17, 150, 51, 5, 7, 78, 24, 149, 76, 153, 59, 100, 53, 94, 27, 220, 164, 218, 240, 126, 188, 58, 20, 174, 40, 178, 47, 309, 167, 114, 244, 13

Offset: 1

Author

Clark Kimberling

Keywords

• nonn

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Programs

Magma

[NthPrime(n^2) mod NthPrime(n): n in [1..90]]; // Vincenzo Librandi, Dec 09 2014

Maple

seq(ithprime(i^2) mod ithprime(i), i=1..1000); # Robert Israel, May 26 2014

Mathematica

Table[Mod[Prime[n^2], Prime[n]], {n, 100}] (* Vincenzo Librandi, Dec 09 2014 *)

PARI

a(n) = prime(n^2) % prime(n); \\ Michel Marcus, Sep 30 2013

Formula

a(n) = A011757(n) modulo A000040(n). - Michel Marcus, Sep 30 2013