|
%I #8 Aug 23 2014 14:54:04
%S 2,23,223,24443,199999,666667,19999999,22222223,666666667,44444444441,
%T 22222222223,2444444444443,17777777777777,88888888888889,
%U 1333333333333333,64444444444444439,88888888888888889
%N Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).
%e a(4) = 24443 ==1 (mod 1111).
%p 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:
%Y Cf. A000042.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 08 2003
%E Corrected and extended by _James A. Sellers_, May 19, 2003
|
