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.

A097989 Numbers n such that n=tau_3(n)=A007425(n).

Original entry on oeis.org

1, 3, 18, 36
Offset: 1

Views

Author

Lekraj Beedassy, Sep 07 2004

Keywords

Comments

Also, numbers n such that n = sum_d|n (tau(d)), (i.e. n is equal to the total number of divisors of all divisors of n ). - Lekraj Beedassy, Jul 12 2008

References

  • J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 36, pp 14, Ellipses, Paris 2008.
  • J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 712 pp. 93;305 Ellipses Paris 2004.

Programs

  • Mathematica
    Select[Range[10^5],Total[(DivisorSigma[0,#]&) /@ Divisors[#]] == #&](* Jean-François Alcover, Sep 14 2011 *)