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.

Showing 1-1 of 1 results.

A055743 Phi(n) has fewer distinct prime divisors than n.

Original entry on oeis.org

2, 6, 10, 12, 15, 20, 24, 30, 34, 40, 42, 48, 51, 60, 66, 68, 70, 78, 80, 84, 85, 90, 96, 102, 105, 110, 114, 120, 126, 130, 132, 136, 138, 140, 150, 156, 160, 165, 168, 170, 174, 180, 182, 190, 192, 195, 204, 210, 220, 222, 228, 230, 234, 238, 240, 246, 252
Offset: 1

Views

Author

Labos Elemer, Jul 11 2000

Keywords

Examples

			n=996 has 3 distinct prime divisors, 2, 3, and 83, while phi(996) = 328 = 2*2*2*41 has only 2 distinct prime factors.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[100], PrimeNu[EulerPhi[#]] < PrimeNu[#] &] (* G. C. Greubel, May 13 2017 *)
  • PARI
    is(n)=my(f=factor(n)); omega(eulerphi(f)) < #f~ \\ Charles R Greathouse IV, Mar 04 2017
Showing 1-1 of 1 results.