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!)
A083808 Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9). 0
2, 23, 223, 24443, 199999, 666667, 19999999, 22222223, 666666667, 44444444441, 22222222223, 2444444444443, 17777777777777, 88888888888889, 1333333333333333, 64444444444444439, 88888888888888889 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..17.

EXAMPLE

a(4) = 24443 ==1 (mod 1111).

MAPLE

with(numtheory): for n from 1 to 30 do u := (10^n-1)/9: for j from u+1 to 1000*u+1 by u do if isprime(j) then printf(`%d, `, j); break; fi: od:od:

CROSSREFS

Cf. A000042.

Sequence in context: A069629 A069614 A036937 * A252016 A037750 A037631

Adjacent sequences:  A083805 A083806 A083807 * A083809 A083810 A083811

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 08 2003

EXTENSIONS

Corrected and extended by James A. Sellers, May 19, 2003

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 May 25 13:19 EDT 2022. Contains 354071 sequences. (Running on oeis4.)