login
a(n) = prime(n^2) mod prime(n).
1

%I #17 Sep 08 2022 08:44:46

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

%T 60,15,50,104,80,39,106,28,97,57,17,150,51,5,7,78,24,149,76,153,59,

%U 100,53,94,27,220,164,218,240,126,188,58,20,174,40,178,47,309,167,114,244,13

%N a(n) = prime(n^2) mod prime(n).

%H Robert Israel, <a href="/A022463/b022463.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A011757(n) modulo A000040(n). - _Michel Marcus_, Sep 30 2013

%p seq(ithprime(i^2) mod ithprime(i), i=1..1000); # _Robert Israel_, May 26 2014

%t Table[Mod[Prime[n^2], Prime[n]], {n, 100}] (* _Vincenzo Librandi_, Dec 09 2014 *)

%o (PARI) a(n) = prime(n^2) % prime(n); \\ _Michel Marcus_, Sep 30 2013

%o (Magma) [NthPrime(n^2) mod NthPrime(n): n in [1..90]]; // _Vincenzo Librandi_, Dec 09 2014

%K nonn

%O 1,3

%A _Clark Kimberling_