login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A220105
2^(n-1) mod n^2.
2
0, 2, 4, 8, 16, 32, 15, 0, 13, 12, 56, 32, 40, 156, 184, 0, 222, 176, 58, 288, 319, 464, 392, 320, 341, 496, 40, 64, 30, 212, 187, 0, 301, 308, 9, 1040, 38, 952, 472, 1088, 944, 1544, 1076, 800, 391, 508, 2069, 2048, 1191, 1312, 922, 2608, 1909, 284, 2359
OFFSET
1,2
COMMENTS
If p is a Wieferich prime, then a(p) = 1, that is, a(A001220(n)) = 1.
a(n) = 0 iff n = 1 or n = 2^k (k >= 3).
a(n) = 1 iff n is either a Wieferich prime or a Wieferich pseudoprime (i.e. a composite c such that c-1 is in A240719). - Felix Fröhlich, Jul 11 2014
EXAMPLE
a(7) = 2^(7-1) mod 7^2 = 64 mod 49 = 15.
MATHEMATICA
Table[PowerMod[2, n - 1, n^2], {n, 100}] (* T. D. Noe, Dec 17 2012 *)
CROSSREFS
Sequence in context: A119990 A036128 A073477 * A070351 A070350 A070349
KEYWORD
nonn
AUTHOR
Franz Vrabec, Dec 17 2012
STATUS
approved