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!)
A049012 Composite numbers n such that number of nonprime d with 0 < d < n, gcd(n,d)=1, is pi(n). 0
33, 75, 94, 106, 118, 1540, 2442, 5340 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers n such that 2*A000720(n) = A000010(n) + A001221(n). - Max Alekseyev, Aug 22 2013
The sequence is finite since the l.h.s. grows as 2n/log(n), while the r.h.s. is asymptotically at least A080130*n/log(log(n)). In fact, known bounds for A000720 and A000010 imply that there are no terms above 10^7, and thus the sequence is full. - Max Alekseyev, Oct 29 2019
LINKS
EXAMPLE
gcd(33,d)=1: d=1,4,8,10,14,16,20,25,26,28,32, pi(33)=11, so 33 is a term.
PROG
(PARI) isok(n) = {if (isprime(n) , return (0)); nb = 0; for (d=1, n-1, if (! isprime(d) && gcd(n, d) == 1, nb++); ); return (nb == primepi(n)); } \\ Michel Marcus, Jul 14 2013
CROSSREFS
Sequence in context: A063868 A184417 A240884 * A137187 A354916 A134037
KEYWORD
nonn,fini,full
AUTHOR
EXTENSIONS
More terms from Michel Marcus, Jul 14 2013
Keywords fini, full added by Max Alekseyev, Oct 29 2019
STATUS
approved

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 May 31 23:52 EDT 2024. Contains 373008 sequences. (Running on oeis4.)