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!)
A215609 Smallest prime p congruent to 1 modulo prime(10^n). 0
3, 59, 9739, 63353, 209459, 15596509, 154858631, 1794246731, 4076149487, 45603526979, 11092303227413, 93864728285579, 1319833868136653 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n)=A035095(10^n).
EXAMPLE
a(0)=3 because p=prime(1)=2, 3=1+p
a(1)=59 because p=prime(10)=29, 59=1+2*p
a(2)=9739 because p=prime(10)=29, 59=1+18*p.
MATHEMATICA
a[n_]:=(If[n<2, 3, p=Prime[n]; r=2p+1; While[!PrimeQ[r], r=r+2p]; r]); Table[a[10^n], {n, 0, 12}]
CROSSREFS
Cf. A035095.
Sequence in context: A062629 A184953 A185153 * A360837 A201184 A046024
KEYWORD
nonn,more
AUTHOR
Zak Seidov, Aug 17 2012
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 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)