The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038604 Primes not containing the digit '2'. 13

%I #77 Aug 04 2023 18:59:20

%S 3,5,7,11,13,17,19,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,

%T 103,107,109,113,131,137,139,149,151,157,163,167,173,179,181,191,193,

%U 197,199,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397

%N Primes not containing the digit '2'.

%C Subsequence of primes of A052404. - _Michel Marcus_, Feb 21 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 Indranil Ghosh, <a href="/A038604/b038604.txt">Table of n, a(n) for n = 1..50000</a>

%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 Intersection of A000040 and A052404. - _M. F. Hasler_, Jan 11 2020

%F a(n) ~ n^(log 10/log 9) log n. - _Charles R Greathouse IV_, Aug 03 2023

%t Select[Prime[Range[70]], DigitCount[#, 10, 2] == 0 &] (* _Vincenzo Librandi_, Aug 08 2011 *)

%o (Magma) [ p: p in PrimesUpTo(400) | not 2 in Intseq(p) ]; // _Bruno Berselli_, Aug 08 2011

%o (PARI) lista(nn, d=2) = {forprime(p=2, nn, if (!vecsearch(vecsort(digits(p),,8), d), print1(p, ", ")););} \\ _Michel Marcus_, Feb 21 2015

%o (PARI)

%o select( {is_A038604(n)=is_A052404(n)&&isprime(n)}, [1..400]) \\ see Wiki for more

%o {next_A038604(n)=until((n==nextprime(n+1))==n=next_A052404(n-1),);n} \\ _M. F. Hasler_, Jan 12 2020

%o (Python)

%o from sympy import isprime, nextprime

%o def is_A038604(n): return str(n).find('2')<0 and isprime(n)

%o def next_A038604(n): # get smallest term > n

%o while True:

%o n = nextprime(n); s = str(n); t = s.find('2')

%o if t < 0: return n

%o t = 10**(len(s)-1-t); n += t - n%t

%o def A038604_upto(stop=math.inf, start=3):

%o while start < stop: yield start; start = next_A038604(start)

%o list(A038604_upto(400))

%o # _M. F. Hasler_, Jan 12 2020

%Y Cf. A000040, A052404.

%Y Subsequence of A065091 (odd primes).

%Y Primes having no digit d = 0..9 are A038618, A038603, this sequence, A038611, A038612, 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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 18:53 EDT 2024. Contains 373206 sequences. (Running on oeis4.)