A265012 a(n) = 10^(prime(n)-1) mod prime(n)^2.
2, 1, 0, 8, 12, 53, 137, 286, 185, 378, 466, 1037, 1518, 1033, 2022, 637, 532, 794, 2011, 3551, 1169, 1660, 2574, 3561, 6597, 5152, 7829, 4816, 10356, 9041, 382, 7206, 16578, 17932, 19073, 12383, 20725, 11248, 21377, 16609, 21660, 21178, 20820, 4826, 37234
Offset: 1
Keywords
Examples
a(2) = a(93) = a(3371851) = 1; prime(2) = 3; prime(93) = 487; prime(3371851) = 56598313.
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Programs
-
Haskell
import Math.NumberTheory.Moduli (powerMod) a265012 n = powerMod 10 (p - 1) (p ^ 2) where p = a000040 n
-
Mathematica
PowerMod[10,#-1 ,#^2]&/@Prime[Range[50]] (* Harvey P. Dale, Feb 10 2016 *)
-
PARI
a(n) = lift(Mod(10, prime(n)^2)^(prime(n)-1)); \\ Michel Marcus, Jan 22 2022