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.

A049692 Numbers k such that the square of the number of divisors of k does not divide the sum of the divisors of k.

Original entry on oeis.org

2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 25, 26, 27, 28, 29, 30, 32, 34, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 60, 61, 63, 64, 65, 66, 68, 70, 72, 73, 74, 75, 76, 78, 80, 81, 82, 84, 85, 86
Offset: 1

Views

Author

Keywords

Comments

The asymptotic density of this sequence is 1/2 (Bateman et al., 1981). - Amiram Eldar, Apr 25 2024

References

  • József Sándor, Dragoslav S. Mitrinovic, and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Chapter III, p. 119, section III.51.

Crossrefs

Cf. A000005, A000203, A003601, A049642, A049645 (complement).

Programs

  • Maple
    with(numtheory): t := [ ]: f := [ ]: for n from 1 to 500 do if sigma(n) mod sigma[ 0 ](n)^2 = 0 then t := [ op(t), n ] else f := [ op(f), n ]; fi; od: f;
  • Mathematica
    Select[Range[1, 100], !Divisible[DivisorSigma[1, #], DivisorSigma[0, #]^2] &] (* Amiram Eldar, Apr 25 2024 *)
  • PARI
    is(n) = {my(f = factor(n)); sigma(f) % numdiv(f)^2 > 0;} \\ Amiram Eldar, Apr 25 2024