[go: up one dir, main page]

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

A215609
Smallest prime p congruent to 1 modulo prime(10^n).
1
3, 59, 9739, 63353, 209459, 15596509, 154858631, 1794246731, 4076149487, 45603526979, 11092303227413, 93864728285579, 1319833868136653, 11656098322067917, 27803086068196217, 1781976386163140977, 32382366940106296979, 100447117955224696057, 707388643757314709297
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
Sequence in context: A062629 A184953 A185153 * A360837 A201184 A046024
KEYWORD
nonn
AUTHOR
Zak Seidov, Aug 17 2012
EXTENSIONS
a(13)-a(18) from Amiram Eldar, Apr 30 2024
STATUS
approved