A199342 Primes having only {2, 3, 4} as digits.

2, 3, 23, 43, 223, 233, 433, 443, 2243, 2333, 2423, 3323, 3343, 3433, 4243, 4423, 22343, 22433, 23333, 24223, 24443, 32233, 32323, 32423, 32443, 33223, 33343, 42223, 42323, 42433, 42443, 43223, 222323, 223243, 223423, 224233, 224423, 224443, 232333, 232433, 233323, 233423, 234323, 234343, 242243, 243233, 243343, 243433, 244243, 244333

Offset: 1

Author

M. F. Hasler, Nov 05 2011

Keywords

• nonn
• base
• easy

Comments

A020458 and A020461 are subsequences. - Vincenzo Librandi, Jul 28 2015

Links

• Jason Bard, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harvey P. Dale)

Crossrefs

Cf. A020449 - A020472, A199325 - A199329, A385768 - A385800.

Cf. similar sequences listed in A199340.

Programs

Magma

[p: p in PrimesUpTo(10^6) | Set(Intseq(p)) subset [3, 4, 2]]; // Vincenzo Librandi, Jul 28 2015

Mathematica

Select[Prime[Range[10^5]], Complement[IntegerDigits[#], {3, 4, 2}]=={}&] (* Vincenzo Librandi, Jul 28 2015 *)
Table[Select[FromDigits/@Tuples[{2,3,4},n],PrimeQ],{n,6}]//Flatten (* Harvey P. Dale, Nov 06 2019 *)

PARI

a(n, list=0, L=[2, 3, 4], reqpal=0)={my(t); for(d=1, 1e9, u=vector(d, i, 10^(d-i))~; forvec(v=vector(d, i, [1+(i==1&!L[1]), #L]), isprime(t=vector(d, i, L[v[i]])*u)||next; reqpal & !isprime(A004086(t)) & next; list & print1(t", "); n--||return(t)))}