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.

A361384 a(n) is the number of distinct prime factors of the n-th unitary harmonic number.

Original entry on oeis.org

0, 2, 2, 3, 3, 4, 4, 3, 4, 5, 4, 5, 4, 3, 4, 5, 4, 5, 4, 4, 3, 5, 4, 5, 5, 5, 5, 5, 5, 4, 5, 5, 4, 5, 5, 5, 5, 4, 4, 4, 5, 6, 5, 6, 5, 5, 6, 6, 5, 5, 6, 6, 5, 5, 6, 6, 6, 6, 5, 6, 5, 6, 6, 6, 5, 6, 5, 6, 5, 6, 5, 6, 4, 5, 6, 6, 6, 6, 5, 6, 5, 6, 6, 6, 6, 5, 6
Offset: 1

Views

Author

Amiram Eldar, Mar 10 2023

Keywords

Comments

Each term appears a finite number of times in the sequence (Hagis and Lord, 1975).

Crossrefs

Programs

  • Mathematica
    uh[n_] := n * Times @@ (2/(1 + Power @@@ FactorInteger[n])); uh[1] = 1; PrimeNu[Select[Range[10^6], IntegerQ[uh[#]] &]]
  • PARI
    uhmean(n) = {my(f = factor(n)); n*prod(i=1, #f~, 2/(1+f[i, 1]^f[i, 2])); };
    lista(kmax) = {my(uh); for(k = 1, kmax, uh = uhmean(k); if(denominator(uh) == 1, print1(omega(k), ", ")));}

Formula

a(n) = A001221(A006086(n)).