OFFSET
1,1
COMMENTS
Subsequence of primes of A052414. - Michel Marcus, Feb 22 2015
Maynard proves that this sequence is infinite and in particular contains the expected number of elements up to x, on the order of x^(log 9/log 10)/log x. - Charles R Greathouse IV, Apr 08 2016
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
M. F. Hasler, Numbers avoiding certain digits OEIS wiki, Jan 12 2020.
James Maynard, Primes with restricted digits, arXiv:1604.01041 [math.NT], 2016.
James Maynard and Brady Haran, Primes without a 7, Numberphile video (2019).
FORMULA
a(n) ~ n^(log 10/log 9) log n. - Charles R Greathouse IV, Aug 03 2023
MAPLE
no6:= proc(n) option remember;
n mod 10 <> 6 and procname(floor(n/10))
end proc:
no6(0):= true:
select(no6 and isprime, [2, seq(i, i=3..1000, 2)]); # Robert Israel, Mar 16 2017
MATHEMATICA
Select[Prime[Range[70]], DigitCount[#, 10, 6] == 0 &] (* Vincenzo Librandi, Aug 08 2011 *)
PROG
(Magma) [ p: p in PrimesUpTo(400) | not 6 in Intseq(p) ]; // Bruno Berselli, Aug 08 2011
(PARI) lista(nn)=forprime(p=2, nn, if (!vecsearch(vecsort(digits(p), , 8), 6), print1(p, ", ")); ); \\ Michel Marcus, Feb 22 2015
(PARI)
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Vasiliy Danilov (danilovv(AT)usa.net), Jul 15 1998
EXTENSIONS
Offset corrected by Arkadiusz Wesolowski, Aug 07 2011
STATUS
approved