login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297967 a(n) = 5^n mod prime(n). 1

%I

%S 1,1,0,2,1,12,10,4,11,20,25,10,39,36,41,13,36,58,52,1,17,26,19,64,13,

%T 5,94,14,25,36,40,74,117,81,6,123,24,155,134,117,20,42,69,36,185,111,

%U 121,16,206,159,42,220,47,123,130,61,57,83,6,79,270,14,91

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

%H Vincenzo Librandi, <a href="/A297967/b297967.txt">Table of n, a(n) for n = 1..5000</a>

%F a(n) = A000351(n) mod A000040(n).

%t Array[PowerMod[5, #, Prime@#]&, 80]

%o (MAGMA) [Modexp(5, n, NthPrime(n)): n in [1..80]];

%Y Cf. A000040, A000351, A064367, A066603, A297966.

%K nonn

%O 1,4

%A _Vincenzo Librandi_, Jan 15 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 04:42 EDT 2020. Contains 337317 sequences. (Running on oeis4.)