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.

A112758 Number of distinct prime factors of n-th 5-smooth number.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 3, 1, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 2, 3, 1, 1, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 3, 1, 2, 1, 3, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 3, 1, 3, 2, 2, 3, 2, 3, 3, 2, 2, 1, 3, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 3, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 18 2005

Keywords

Crossrefs

Programs

  • Mathematica
    aa = {}; Do[If[8 n - EulerPhi[30 n] == 0, AppendTo[aa, n]], {n, 1, 100}]; PrimeNu[aa]  (* G. C. Greubel, May 07 2017 *)
    PrimeNu[#]&/@Select[Range[2000],Max[FactorInteger[#][[All,1]]]<6&] (* Harvey P. Dale, Apr 12 2020 *)

Formula

a(n) = A001221(A051037(n)).
a(n) = 3 - 0^A112760(n) - 0^A112761(n) - 0^A112762(n).
a(n) <= 3.