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.

A055679 Number of distinct prime factors of phi(n!).

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14
Offset: 1

Views

Author

Labos Elemer, Jul 11 2000

Keywords

Comments

Number of distinct prime factors of n! and phi(n!) are respectively pi(n) and pi(floor(n/2)).

Crossrefs

Programs

  • Mathematica
    PrimeNu[EulerPhi[Range[90]!]] (* Harvey P. Dale, Sep 27 2011 *)
  • PARI
    for(n=1,50, print1(omega(eulerphi(n!)), ", ")) \\ G. C. Greubel, May 19 2017
    
  • PARI
    a(n) = primepi(n\2); \\ Michel Marcus, Aug 13 2024

Formula

a(n) = pi(floor(n/2)).
Showing 1-1 of 1 results.