cp's OEIS Frontend

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

%I A036953 #35 Jul 20 2025 17:45:29
%S A036953 2,11,101,211,1021,1201,2011,2111,2221,10111,10211,12011,12101,12211,
%T A036953 20011,20021,20101,20201,21001,21011,21101,21121,21211,21221,22111,
%U A036953 101021,101111,101221,102001,102101,102121,110221,111121,111211,112111
%N A036953 Primes having only {0, 1, 2} as digits.
%C A036953 Number of n-digit terms d(n) = (1, 1, 2, 5, 16, 34, 76, 194, 543, 1469, 4094, 11017, ...); e.g., there are five 4-digit terms: 1021, 1201, 2011, 2111, 2221, hence d(4) = 5. - _Zak Seidov_, Jun 30 2013
%C A036953 Also, primes in A007089. - _M. F. Hasler_, Jul 25 2015
%H A036953 Zak Seidov, <a href="/A036953/b036953.txt">Table of n, a(n) for n = 1..10000</a>
%H A036953 James Maynard and Brady Haran, <a href="https://www.youtube.com/watch?v=eeoBCS7IEqs">Primes without a 7</a>, Numberphile video (2019)
%H A036953 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%t A036953 Select[FromDigits/@Tuples[{0,1,2},6],PrimeQ] (* _Harvey P. Dale_, Jul 11 2017 *)
%o A036953 (Python) from gmpy2 import digits
%o A036953 from sympy import isprime
%o A036953 [int(digits(n,3)) for n in range(1000) if isprime(int(digits(n,3)))] # _Chai Wah Wu_, Jul 31 2014
%o A036953 (PARI) lista(n) = {forprime(p=2, n, if (vecmax(digits(p)) <= 2, print1(p, ", ")))} \\ _Michel Marcus_, Aug 02 2014
%o A036953 (PARI) A036953={(n,show=0)->for(d=1,1e9,my(u=vector(d,i,10^(d-i))~);forvec(v=vector(d,i,if(i>1,if(i<d,[0,2],[1,1]),[1,2])), ispseudoprime(v*u)||next;show&&print1(v*u,",");n--||return(v*u)))} \\ _M. F. Hasler_, Jul 25 2015
%Y A036953 Subsequence of A107715.
%Y A036953 Cf. A036952-A036964.
%Y A036953 Cf. A020450 - A020472, A260044, A260267 - A260271, A199325 - A199329, A061247, A199340 - A199349, A217039, A079651.
%K A036953 nonn,base
%O A036953 1,1
%A A036953 _Patrick De Geest_, Jan 04 1999
%E A036953 Edited by _M. F. Hasler_, Jul 25 2015