OFFSET
1,1
COMMENTS
Conjecture: There exists a number k such that for all m > k, m not == 0 or 2 (mod 3), a(m) does not use any extra digit.
LINKS
Ray Chandler, Table of n, a(n) for n = 1..369 (terms < 10^1000)
Ray Chandler, Mathematica program for A088628
EXAMPLE
a(5) = 112543 which is the smallest prime containing digits 1 to 5.
a(10) = 10123457689 is the smallest prime containing digits of 1,2,3,4,5,6,7,8,9 and 10.
MATHEMATICA
For a(11): d = {1, 0, 1, 1, 1, 1, 1, 2, 2, 3, 4}; a = Map[ FromDigits, Join[ d, # ] & /@ Permutations[{5, 6, 7, 8, 9}]]; Min[ Select[ a, PrimeQ[ # ] & ]] (* Robert G. Wilson v, Nov 06 2003 *)
(* See above link for another program *)
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Oct 21 2003
EXTENSIONS
a(8) and a(9) from Robert G. Wilson v, Oct 22 2003
a(10) from Ray Chandler, Nov 01 2003
a(11) through a(16) from Robert G. Wilson v, Nov 06 2003
STATUS
approved