login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #12 Jun 09 2022 19:42:48

%S 0,0,1,0,1,4,1,0,7,4,1,4,1,4,1,0,1,16,1,4,16,4,1,16,6,4,7,8,1,4,1,0,

%T 16,4,11,16,1,4,16,24,1,16,1,20,16,4,1,16,29,44,16,12,1,34,36,32,16,4,

%U 1,4,1,4,16,0,61,34,1,64,16,64,1,16,1,4,31,64,4,10,1,64,61,4,1,16,1,4,16

%N a(n) = 4^(n-1) mod n.

%H Harry J. Smith, <a href="/A062175/b062175.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>

%t Table[PowerMod[4,n-1,n],{n,90}] (* _Harvey P. Dale_, Jun 09 2022 *)

%o (PARI) { for (n=1, 1000, write("b062175.txt", n, " ", 4^(n - 1)%n) ) } \\ _Harry J. Smith_, Aug 02 2009

%Y Cf. A062172.

%K nonn

%O 1,6

%A _Henry Bottomley_, Jun 12 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 07:40 EDT 2024. Contains 370958 sequences. (Running on oeis4.)