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

A109350
Numbers whose anti-divisors sum to a prime.
2
3, 4, 5, 12, 13, 24, 41, 60, 84, 113, 144, 180, 264, 265, 312, 480, 761, 1012, 1104, 1105, 1201, 1405, 1624, 1740, 1741, 1861, 2112, 2113, 3281, 4140, 4141, 5304, 5512, 5724, 5940, 6385, 6612, 7320, 7564, 7565, 8580, 8845, 9385, 9660, 9661, 9941
OFFSET
1,1
COMMENTS
See A066272 for definition of anti-divisor.
LINKS
Jon Perry. The Anti-Divisor.
Jon Perry. The Anti-divisor [Cached copy]
EXAMPLE
The anti-divisors of 761 are {2, 3, 9, 13, 39, 117, 169, 507} and these sum to 859, a prime, so 761 is in the sequence.
MATHEMATICA
AntiDivisors[n_] := Union[Drop[Drop[Divisors[2*n-1], 1], -1], Map[2*n/#&, Drop[Select[Divisors[2*n], OddQ], 1]], Drop[Drop[Divisors[2*n+1], 1], -1]]; Do[p = Plus @@ AntiDivisors[n]; If[PrimeQ[p], Print[n]], {n, 2, 10^4}]
PROG
(Python)
from sympy import isprime, divisors
A109350 = [n for n in range(1, 10**6) if isprime(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]))]
# Chai Wah Wu, Aug 12 2014
CROSSREFS
Sequence in context: A235598 A191197 A055493 * A239356 A077034 A076601
KEYWORD
nonn
AUTHOR
Ryan Propper, Aug 21 2005
STATUS
approved