This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A297966 #22 Sep 08 2022 08:46:20 %S A297966 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 A297966 73,53,9,91,114,100,79,121,38,127,122,113,126,138,82,114,118,112,119, %U A297966 10,108,30,188,20,188,30,174,169,5,52,15,241,202,222,50,267 %N A297966 a(n) = 3^n mod prime(n). %H A297966 Vincenzo Librandi, <a href="/A297966/b297966.txt">Table of n, a(n) for n = 1..5000</a> %F A297966 a(n) = A000244(n) mod A000040(n). %p A297966 seq(3 &^ n mod ithprime(n), n=1..65); # _Muniru A Asiru_, Mar 12 2018 %t A297966 Array[PowerMod[3, #, Prime@#]&, 80] %o A297966 (Magma) [Modexp(3, n, NthPrime(n)): n in [1..80]]; %o A297966 (PARI) a(n) = lift(Mod(3, prime(n))^n); \\ _Michel Marcus_, Jan 11 2018 %o A297966 (GAP) P:=Filtered([1..1500],IsPrime);;List([1..65],n->PowerModInt(3,n,P[n])); # _Muniru A Asiru_, Mar 12 2018 %Y A297966 Cf. A000040, A000244, A064367, A066601. %K A297966 nonn,easy %O A297966 1,3 %A A297966 _Vincenzo Librandi_, Jan 11 2018