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!)
A070854 Smallest prime == 1 mod (10^n). 1
11, 101, 3001, 70001, 700001, 22000001, 30000001, 600000001, 6000000001, 30000000001, 1900000000001, 18000000000001, 40000000000001, 3900000000000001, 6000000000000001, 130000000000000001, 3700000000000000001, 15000000000000000001, 150000000000000000001, 600000000000000000001, 16000000000000000000001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(6) through a(21) have been certified prime with Primo. - Rick L. Shepherd, Jun 03 2002
LINKS
FORMULA
a(n) = A121172(n)*10^n + 1. - Ray Chandler, Feb 10 2009
PROG
(PARI) b(n, k) = k*10^n+1 for(n=1, 25, k=1; while(!isprime(b(n, k)), k++); print1(b(n, k), ", "))
CROSSREFS
Sequence in context: A135563 A233432 A052075 * A075767 A292014 A080176
KEYWORD
nonn
AUTHOR
Amarnath Murthy, May 15 2002
EXTENSIONS
More terms from Rick L. Shepherd, Jun 03 2002
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 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)