A083808 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A083808

Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).

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