|
%I #22 Sep 08 2022 08:46:20
%S 1,0,2,4,1,1,11,6,18,5,13,10,38,36,42,15,19,34,5,32,46,51,49,39,94,30,
%T 73,53,9,91,114,100,79,121,38,127,122,113,126,138,82,114,118,112,119,
%U 10,108,30,188,20,188,30,174,169,5,52,15,241,202,222,50,267
%N a(n) = 3^n mod prime(n).
%H Vincenzo Librandi, <a href="/A297966/b297966.txt">Table of n, a(n) for n = 1..5000</a>
%F a(n) = A000244(n) mod A000040(n).
%p seq(3 &^ n mod ithprime(n), n=1..65); # _Muniru A Asiru_, Mar 12 2018
%t Array[PowerMod[3, #, Prime@#]&, 80]
%o (Magma) [Modexp(3, n, NthPrime(n)): n in [1..80]];
%o (PARI) a(n) = lift(Mod(3, prime(n))^n); \\ _Michel Marcus_, Jan 11 2018
%o (GAP) P:=Filtered([1..1500],IsPrime);;List([1..65],n->PowerModInt(3,n,P[n])); # _Muniru A Asiru_, Mar 12 2018
%Y Cf. A000040, A000244, A064367, A066601.
%K nonn,easy
%O 1,3
%A _Vincenzo Librandi_, Jan 11 2018
|
