The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036953 Primes containing only digits from the set {0, 1, 2}. 15
 2, 11, 101, 211, 1021, 1201, 2011, 2111, 2221, 10111, 10211, 12011, 12101, 12211, 20011, 20021, 20101, 20201, 21001, 21011, 21101, 21121, 21211, 21221, 22111, 101021, 101111, 101221, 102001, 102101, 102121, 110221, 111121, 111211, 112111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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 Also, primes in A007089. - M. F. Hasler, Jul 25 2015 LINKS Zak Seidov, Table of n, a(n) for n = 1..10000 James Maynard and Brady Haran, Primes without a 7, Numberphile video (2019) MATHEMATICA Select[FromDigits/@Tuples[{0, 1, 2}, 6], PrimeQ] (* Harvey P. Dale, Jul 11 2017 *) PROG (Python) from gmpy2 import digits from sympy import isprime [int(digits(n, 3)) for n in range(1000) if isprime(int(digits(n, 3)))] # Chai Wah Wu, Jul 31 2014 (PARI) lista(n) = {forprime(p=2, n, if (vecmax(digits(p)) <= 2, print1(p, ", ")))} \\ Michel Marcus, Aug 02 2014 (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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 10 16:56 EDT 2020. Contains 336381 sequences. (Running on oeis4.)