OFFSET
1,1
COMMENTS
All the terms are congruent to 1 or 2 (mod 3).
In no term does the digit 0, 2, 4, 5, 6, or 8 appear six times.
LINKS
K. D. Bajpai, Table of n, a(n) for n = 1..35
EXAMPLE
a(1) = 1111151 has exactly six 1's together with a single digit 5.
a(8) = 2999999 has exactly six 9's together with a single digit 2.
MAPLE
sort(select(isprime, [seq(seq(seq(d*1111111 + (a-d)*10^k, k=0..6), a={$1..9} minus {d}), d=1..9)])); # Robert Israel, Jul 13 2015
MATHEMATICA
kQ[n_]:= Module[{d=Select[DigitCount[n], # > 0 &]}, Length[d] == 2 && Min[d] == 1 && Max[d] == 6]; Select[Table[Prime[n], {n, 1000000}], kQ]
Select[Prime[Range[80000, 400000]], MemberQ[DigitCount[#], 6] &] (* Vincenzo Librandi, Jul 14 2015 *)
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
K. D. Bajpai, Jul 13 2015
STATUS
approved