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!)
A265012 a(n) = 10^(prime(n)-1) mod prime(n)^2. 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) < A001248(n);
a(A049084(A045616(n))) = 1.
EXAMPLE
a(2) = a(93) = a(3371851) = 1;
prime(2) = 3; prime(93) = 487; prime(3371851) = 56598313.
MATHEMATICA
PowerMod[10, #-1 , #^2]&/@Prime[Range[50]] (* Harvey P. Dale, Feb 10 2016 *)
PROG
(Haskell)
import Math.NumberTheory.Moduli (powerMod)
a265012 n = powerMod 10 (p - 1) (p ^ 2) where p = a000040 n
(PARI) a(n) = lift(Mod(10, prime(n)^2)^(prime(n)-1)); \\ Michel Marcus, Jan 22 2022
CROSSREFS
Sequence in context: A266042 A202817 A322222 * A285285 A338858 A201897
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Nov 30 2015
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 19 08:08 EDT 2024. Contains 371782 sequences. (Running on oeis4.)