login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A171256 Numbers n such that sigma(n) = 10*phi(n) (where sigma=A000203, phi=A000010). 5
168, 270, 570, 2376, 2436, 5016, 6426, 7110, 13566, 15834, 34452, 58520, 62568, 72732, 75210, 113832, 126882, 168756, 169218, 191862, 199368, 223938, 240312, 280488, 308568, 321468, 420888, 449442, 472758, 661848, 673608, 776736, 848540, 854496, 907236 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If n is in this sequence, then for any prime p not dividing n, sigma(np) - 10*phi(np) = 2*sigma(n).
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, #] == 10 * EulerPhi[#] &] (* Amiram Eldar, Dec 04 2019 *)
PROG
(PARI) for(k=1, 10^6, sigma(k) - 10*eulerphi(k) | print1(k", "));
CROSSREFS
Sequence in context: A338605 A196591 A060662 * A059463 A302365 A038812
KEYWORD
nonn
AUTHOR
M. F. Hasler, Mar 19 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)