OFFSET
1,1
COMMENTS
From David A. Corneth, Sep 14 2019: (Start)
Terms can't contain digits of the form 0 (mod 3), 1 (mod 3) and 2 (mod 3) as then one can remove a digit to get a multiple of 3. Classifying digits mod 3 could give further restrictions on the frequency of digits per class.
For example, let (d0, d1, d2) be the frequency of digits from each residue class mod 3 respectively. Then a term can't be of the form (0, 2, 3) as removing a digit from the class 2 (mod 3) gives a multiple of 3. (End)
LINKS
David A. Corneth, Table of n, a(n) for n = 1..502 (first 200 terms from T. D. Noe, terms n = 201..299 from R. Zumkeller, terms <= 10^11).
MATHEMATICA
With[{nn=5000}, Select[Complement[Range[10, nn], Prime[Range[ PrimePi[ nn]]]], DigitCount[#, 10, 0]==0&&And@@PrimeQ[FromDigits/@Subsets[ IntegerDigits[#], {IntegerLength[#]-1}]]&]] (* Harvey P. Dale, Apr 06 2012 *)
PROG
(Haskell)
a034304 n = a034304_list !! (n-1)
a034304_list = map read $ filter (f "") $
map show $ dropWhile (< 10) a259315_list :: [Integer] where
f _ "" = True
f us (v:vs) = a010051' (read (us ++ vs)) == 1 && f (us ++ [v]) vs
-- Reinhard Zumkeller, Jun 24 2015
CROSSREFS
KEYWORD
base,nonn,nice
AUTHOR
EXTENSIONS
Definition corrected by T. D. Noe, Apr 02 2008
STATUS
approved