cp's OEIS Frontend

A240546 a(n) = prime(n+1)^n mod prime(n).

%I A240546 #30 Jun 27 2024 22:21:29
%S A240546 1,1,3,4,10,1,9,5,16,9,26,10,33,1,2,49,33,3,35,48,3,32,62,64,4,20,8,
%T A240546 62,93,83,64,41,68,79,138,125,88,56,4,169,72,36,40,144,73,140,63,120,
%U A240546 24,218,67,48,58,194,126,54,74,223,74,59,176,161,280,208,215,236,82,141,139,344,7
%N A240546 a(n) = prime(n+1)^n mod prime(n).
%C A240546 prime(k+1)^k mod prime(k) = k: 1, 3, 4, 76, 7743, ... .
%H A240546 Alois P. Heinz, <a href="/A240546/b240546.txt">Table of n, a(n) for n = 1..10000</a>
%e A240546 a(5) = prime(5+1)^5 mod prime(5) = 13^5 mod 11 = 10.
%p A240546 a:= n-> ithprime(n+1) &^n mod ithprime(n):
%p A240546 seq(a(n), n=1..100);  # _Alois P. Heinz_, Apr 30 2014
%t A240546 Table[Mod[Prime[n + 1]^n, Prime[n]], {n, 80}] (* _Alonso del Arte_, Apr 11 2014 *)
%t A240546 Table[PowerMod[Prime[n+1],n,Prime[n]],{n,80}] (* _Harvey P. Dale_, Jun 11 2019 *)
%o A240546 (Magma) [(NthPrime(n+1)^n mod NthPrime(n)): n in [1..100]]; // _Juri-Stepan Gerasimov_, Apr 07 2014
%o A240546 (PARI) a(n)=my(p=prime(n)); lift(Mod(nextprime(p+1),p)^n) \\ _Charles R Greathouse IV_, Apr 08 2014
%Y A240546 Cf. A038702.
%K A240546 nonn,less
%O A240546 1,3
%A A240546 _Irina Gerasimova_, Apr 07 2014