|
| |
|
|
A062173
|
|
2^(n-1) mod n.
|
|
15
| |
|
|
0, 0, 1, 0, 1, 2, 1, 0, 4, 2, 1, 8, 1, 2, 4, 0, 1, 14, 1, 8, 4, 2, 1, 8, 16, 2, 13, 8, 1, 2, 1, 0, 4, 2, 9, 32, 1, 2, 4, 8, 1, 32, 1, 8, 31, 2, 1, 32, 15, 12, 4, 8, 1, 14, 49, 16, 4, 2, 1, 8, 1, 2, 4, 0, 16, 32, 1, 8, 4, 22, 1, 32, 1, 2, 34, 8, 9, 32, 1, 48, 40, 2, 1, 32, 16, 2, 4, 40, 1, 32, 64
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| If p is an odd prime then a(p)=1. However, a(n) is also 1 for pseudoprimes to base 2 such as 341.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
Index entries for sequences related to pseudoprimes
|
|
|
EXAMPLE
| a(5) = 2^(5-1) mod 5 = 16 mod 5 = 1.
|
|
|
MATHEMATICA
| Table[Mod[2^(n-1), n], {n, 200}] (*From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), 28 Nov 2010*)
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b062173.txt", n, " ", 2^(n - 1)%n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 02 2009]
|
|
|
CROSSREFS
| Cf. A001567, A015919, A062172.
Sequence in context: A062296 A140649 A091453 * A004558 A129699 A002349
Adjacent sequences: A062170 A062171 A062172 * A062174 A062175 A062176
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), Jun 12 2001
|
| |
|
|
