OFFSET
1,1
COMMENTS
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (calculated using data from Jud McCranie, terms 1..1000 from Donovan Johnson)
Kevin A. Broughan and Daniel Delbourgo, On the Ratio of the Sum of Divisors and Euler’s Totient Function I, Journal of Integer Sequences, Vol. 16 (2013), Article 13.8.8.
Kevin A. Broughan and Qizhi Zhou, On the Ratio of the Sum of Divisors and Euler's Totient Function II, Journal of Integer Sequences, Vol. 17 (2014), Article 14.9.2.
EXAMPLE
p>2, q=2^p-1(q is prime); m=15*2^(p-2)*q so sigma(m)=24*(2^(p-1)-1)*2^p=12*(8*2^(p-3)*(2^p-2))=12*phi(m) hence m is in the sequence.
sigma(237000)=748800=12*62400=12*phi(237000) so 237000 is in the sequence but 237000 is not of the form 15*2^(p-2)*(2^p-1).
MATHEMATICA
Do[If[DivisorSigma[1, m] == 12*EulerPhi[m], Print[m]], {m, 1200000}]
PROG
(PARI) is(n)=sigma(n)==12*eulerphi(n) \\ Charles R Greathouse IV, May 09 2013
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Farideh Firoozbakht, Apr 01 2005
STATUS
approved