OFFSET
1,1
COMMENTS
For 16 < n < 10^8, a(n) = 3*prime(n). Note also that a(n) is odd for n > 1. - Charles R Greathouse IV, Nov 19 2015
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..10000
EXAMPLE
If p is a prime other than 3, 2*phi(3p) = 2(2p-2) = 4p - 4, sigma(3p) = 4p + 4, 2*phi(3p) + 8 = sigma(3p). So numbers of the form 3p are in the sequence. Also if k=175, phi(175) = 120, sigma(175) = 248, thus 2*phi(175) + 8 = sigma(175), so 175 is here. Note that 175 is not of the form 3p. No additional terms not of the form 3p were found below 100000.
MATHEMATICA
Select[Range[800], 2*EulerPhi[#]+8==DivisorSigma[1, #]&] (* Harvey P. Dale, Dec 28 2017 *)
PROG
(PARI) n=-1; for (m=1, 10^9, if (sigma(m) - 2*eulerphi(m) == 8, write("b063466.txt", n++, " ", m); if (n==1000, break))) \\ Harry J. Smith, Aug 22 2009
(PARI) is(n)=my(f=factor(n)); 2*eulerphi(f)+8 == sigma(f) \\ Charles R Greathouse IV, Nov 19 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 26 2001
STATUS
approved