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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
MATHEMATICA
Table[PowerMod[4, n-1, n], {n, 90}] (* Harvey P. Dale, Jun 09 2022 *)
PROG
(PARI) { for (n=1, 1000, write("b062175.txt", n, " ", 4^(n - 1)%n) ) } \\ Harry J. Smith, Aug 02 2009
CROSSREFS
Cf. A062172.
Sequence in context: A296794 A119305 A198215 * A085659 A245099 A176219
KEYWORD
nonn
AUTHOR
Henry Bottomley, Jun 12 2001
STATUS
approved

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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)