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”).
%I #7 Oct 14 2023 21:39:35
%S 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,
%T 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,
%U 0,1,0,1,0,2,0,1,0,2,0,1,0,0,0,2,0,2,0,2
%N Number of numbers m such that the sum of the anti-divisors of m is n+1.
%C See A066272 for definition of anti-divisor.
%H Jon Perry, <a href="http://www.users.globalnet.co.uk/~perry/maths">Anti-divisor</a>
%H Jon Perry, <a href="/A066272/a066272a.html">The Anti-divisor</a> [Cached copy]
%H Jon Perry, <a href="/A066272/a066272.html">The Anti-divisor: Even More Anti-Divisors</a> [Cached copy]
%e 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.
%Y Cf. A066417, A066418, A058838, A066241.
%K nonn
%O 1,8
%A _Jon Perry_, Dec 28 2001