cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A049011 Composite numbers k such that number of composite d with 3 < d < k, gcd(k, d) = 1, is pi(k).

Original entry on oeis.org

27, 286, 370, 520, 550, 1332, 13530, 38220
Offset: 1

Views

Author

Keywords

Comments

Composite numbers k such that phi(k) + omega(k) = 2*pi(k) + 1. - Jinyuan Wang, Sep 05 2020

Examples

			gcd(27,d)=1: d=4,8,10,14,16,20,22,25,26, pi(27)=9, so 27 is a term.
		

Crossrefs

Cf. A036997.

Programs

  • PARI
    isok(n) = {if (isprime(n) , return (0)); nb = 0; forcomposite (d=4, n-1, if (gcd(n, d) == 1, nb++);); return (nb == primepi(n));} \\ Michel Marcus, Jul 14 2013

Extensions

a(6)-a(8) from Michel Marcus, Jul 14 2013