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

A066416
Number of numbers m such that the sum of the anti-divisors of m is n+1.
2
0, 1, 1, 1, 1, 0, 0, 2, 0, 1, 0, 1, 1, 2, 0, 1, 0, 2, 1, 0, 0, 1, 1, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 1, 1, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 1, 3, 1, 3, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 0, 2, 0, 2, 0, 2
OFFSET
1,8
COMMENTS
See A066272 for definition of anti-divisor.
LINKS
Jon Perry, Anti-divisor
Jon Perry, The Anti-divisor [Cached copy]
EXAMPLE
8 has anti-divisors 1, 3 and 5, whose sum is 9 and 9 has anti-divisors 1, 2 and 6, whose sum is 9 and there are no others. Therefore a(8)=2.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jon Perry, Dec 28 2001
STATUS
approved