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”).

A178445
a(n) = prime(n)^2 mod n^2.
0
0, 1, 7, 1, 21, 25, 44, 41, 43, 41, 114, 73, 160, 85, 184, 249, 13, 157, 157, 241, 37, 433, 12, 433, 34, 61, 403, 473, 107, 169, 753, 777, 256, 825, 151, 769, 7, 577, 511, 1129, 102, 1009, 1350, 465, 334, 1513, 341, 1345, 1108, 2441
OFFSET
1,3
FORMULA
a(n) = A001248(n) mod A000290(n). [Corrected by Georg Fischer, Dec 13 2022]
MATHEMATICA
Table[PowerMod[Prime[n], 2, n^2], {n, 50}] (* Harvey P. Dale, Jan 23 2013 *)
CROSSREFS
Sequence in context: A229825 A274717 A050310 * A019431 A264615 A261248
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected by R. J. Mathar, Dec 22 2010
STATUS
approved