A107715 Primes having only {0,1,2,3} as digits.

2, 3, 11, 13, 23, 31, 101, 103, 113, 131, 211, 223, 233, 311, 313, 331, 1013, 1021, 1031, 1033, 1103, 1123, 1201, 1213, 1223, 1231, 1301, 1303, 1321, 2003, 2011, 2111, 2113, 2131, 2203, 2213, 2221, 2311, 2333, 3001, 3011, 3023, 3121, 3203, 3221, 3301, 3313

Offset: 1

Author

Rick L. Shepherd, May 22 2005

Keywords

• base
• nonn

Links

• Jason Bard, Table of n, a(n) for n = 1..10000 (first 1000 terms from Reinhard Zumkeller)

Crossrefs

Subsequence of A036956.

Cf. A036953 (primes containing digits from set {0, 1, 2}).

Cf. A010051, A007090, A193890, A385776.

Programs

Haskell

a107715 n = a107715_list !! (n-1)
a107715_list = filter ((== 1) . a010051) a007090_list
-- Reinhard Zumkeller, Aug 11 2011

Mathematica

Select[Prime[Range[500]],Max[IntegerDigits[#]]<4&] (* Harvey P. Dale, May 09 2012 *)
Select[FromDigits/@Tuples[{0,1,2,3},4],PrimeQ] (* Harvey P. Dale, Mar 06 2016 *)

Python

from gmpy2 import digits
from sympy import isprime
[int(digits(n,4)) for n in range(1000) if isprime(int(digits(n,4)))] # Chai Wah Wu, Jul 31 2014

Python

print(list(islice(primes_with("0123"), 41))) # uses function/imports in A385776. Jason Bard, Jul 18 2025