login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A097989
Numbers n such that n=tau_3(n)=A007425(n).
1
OFFSET
1,2
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.
MATHEMATICA
Select[Range[10^5], Total[(DivisorSigma[0, #]&) /@ Divisors[#]] == #&](* Jean-François Alcover, Sep 14 2011 *)
CROSSREFS
Sequence in context: A063116 A125284 A372707 * A039700 A069147 A337921
KEYWORD
fini,full,nonn
AUTHOR
Lekraj Beedassy, Sep 07 2004
STATUS
approved