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”).

A171257
Numbers n such that sigma(n) = 11*phi(n) (where sigma=A000203, phi=A000010).
5
2580, 16770, 18630, 28896, 35970, 61404, 66024, 147576, 163944, 215124, 224010, 296184, 399126, 408672, 443394, 464340, 476010, 574308, 856086, 862752, 868428, 931224, 957348, 1004910, 1110186, 1496610, 1721720, 1723290, 1833348, 1971288, 2139852, 2234790
OFFSET
1,1
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.
MATHEMATICA
Select[Range[10^6], DivisorSigma[1, #] == 11 * EulerPhi[#] &] (* Amiram Eldar, Dec 04 2019 *)
PROG
(PARI) for(k=1, 2e6, sigma(k) - 11*eulerphi(k) || print1(k", "));
KEYWORD
nonn
AUTHOR
STATUS
approved