|
Search: id:A083808
|
|
|
| A083808 |
|
Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9). |
|
+0
1
|
|
| 2, 23, 223, 24443, 199999, 666667, 19999999, 22222223, 666666667, 44444444441, 22222222223, 2444444444443, 17777777777777, 88888888888889, 1333333333333333, 64444444444444439, 88888888888888889
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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 this_sequence A037750 A037631 A026075
Adjacent sequences: A083805 A083806 A083807 this_sequence A083809 A083810 A083811
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), May 08 2003
|
|
EXTENSIONS
|
Corrected and extended by James A. Sellers (sellersj(AT)math.psu.edu), May 19, 2003
|
|
|
Search completed in 0.002 seconds
|
