|
%I #38 Aug 04 2023 18:59:05
%S 2,3,5,7,11,13,17,19,23,29,31,37,53,59,61,67,71,73,79,83,89,97,101,
%T 103,107,109,113,127,131,137,139,151,157,163,167,173,179,181,191,193,
%U 197,199,211,223,227,229,233,239,251,257,263,269,271,277,281,283,293
%N Primes not containing the digit '4'.
%C Subsequence of primes of A052406. - _Michel Marcus_, Feb 22 2015
%C 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
%H M. F. Hasler, <a href="/wiki/Numbers_avoiding_certain_digits">Numbers avoiding certain digits</a> OEIS wiki, Jan 12 2020.
%H James Maynard, <a href="http://arxiv.org/abs/1604.01041">Primes with restricted digits</a>, arXiv:1604.01041 [math.NT], 2016.
%H James Maynard and Brady Haran, <a href="https://www.youtube.com/watch?v=eeoBCS7IEqs">Primes without a 7</a>, Numberphile video (2019).
%F a(n) ~ n^(log 10/log 9) log n. - _Charles R Greathouse IV_, Aug 03 2023
%t Select[Prime[Range[70]], DigitCount[#, 10, 4] == 0 &] (* _Vincenzo Librandi_, Aug 08 2011 *)
%o (Magma) [ p: p in PrimesUpTo(300) | not 4 in Intseq(p) ]; // _Bruno Berselli_, Aug 08 2011
%o (PARI)
%o lista(nn)=forprime(p=2, nn, if (!vecsearch(vecsort(digits(p),,8), 4), print1(p, ", "));); \\ _Michel Marcus_, Feb 22 2015
%o ( {A038612_upto(N)=select( is_A052406, primes([1, N]))} )(444) \\ or better:
%o next_A038612(n)={until(isprime(n), n=next_A052406(nextprime(n+1)-1)); n}
%o ( {A038612_vec(n,M=1)=M--;vector(n,i, n=next_A038612(if(i>1, n)))} )(20, 1000)
%o \\ (See the OEIS wiki page for more.) - _M. F. Hasler_, Jan 12 2020
%Y Intersection of A000040 (primes) and A052406 (numbers without digit 4).
%Y Primes having no digit d = 0..9 are A038618, A038603, A038604, A038611, this sequence, A038613, A038614, A038615, A038616, and A038617, respectively.
%K nonn,easy,base
%O 1,1
%A Vasiliy Danilov (danilovv(AT)usa.net), Jul 15 1998
%E Offset corrected by _Arkadiusz Wesolowski_, Aug 07 2011
|
