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.

A286325 Bi-unitary harmonic numbers.

Original entry on oeis.org

1, 6, 45, 60, 90, 270, 420, 630, 672, 2970, 5460, 8190, 9072, 9100, 10080, 15925, 22680, 22848, 27300, 30240, 40950, 45360, 54600, 81900, 95550, 99792, 136500, 163800, 172900, 204750, 208656, 245700, 249480, 312480, 332640, 342720, 385560, 409500, 472500, 491400
Offset: 1

Views

Author

Michel Marcus, May 07 2017

Keywords

Comments

A number m is a term if the sum of its bi-unitary divisors, A188999(m) divides the product of m by the number of its bi-unitary divisors A286324(m).
Numbers k whose harmonic mean of their bi-unitary divisors, A361782(k)/A361783(k), is an integer. - Amiram Eldar, Mar 24 2023

Crossrefs

Cf. A001599 (Ore harmonic), A006086 (unitary harmonic).

Programs

  • Mathematica
    f[p_, e_] := p^e * If[OddQ[e], (e + 1)*(p - 1)/(p^(e + 1) - 1), e/((p^(e + 1) - 1)/(p - 1) - p^(e/2))]; bhQ[n_] := IntegerQ[Times @@ f @@@ FactorInteger[n]]; bhQ[1] = True; Select[Range[10^5], bhQ] (* Amiram Eldar, Mar 24 2023 *)
  • PARI
    udivs(n) = {my(d = divisors(n)); select(x->(gcd(x, n/x)==1), d); }
    gcud(n, m) = vecmax(setintersect(udivs(n), udivs(m)));
    biudivs(n) = select(x->(gcud(x, n/x)==1), divisors(n));
    isok(n) = my(v=biudivs(n)); denominator(n*#v/vecsum(v))==1;