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

A074713
Numbers n such that the sum of the anti-divisors of n = phi(n).
1
3, 19, 131, 139, 3949, 5881, 11341, 29501, 65789, 5440591, 2471800109
OFFSET
1,1
COMMENTS
See A066272 for definition of anti-divisor.
a(12) > 6*10^9. - Donovan Johnson, Feb 04 2012
PROG
(Python)
from sympy import divisors, totient
A074713 = [n for n in range(1, 10**5) if sum([2*d for d in divisors(n) if n > 2*d and n%(2*d)] + [d for d in divisors(2*n-1) if n > d >=2 and n%d] + [d for d in divisors(2*n+1) if n > d >=2 and n%d]) == totient(n)] # Chai Wah Wu, Aug 12 2014
CROSSREFS
Sequence in context: A058860 A074568 A219053 * A199484 A063395 A226459
KEYWORD
more,nonn
AUTHOR
Jason Earls, Sep 04 2002
EXTENSIONS
Offset corrected and a(10)-a(11) from Donovan Johnson, Feb 04 2012
STATUS
approved