This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A066416 #7 Oct 14 2023 21:39:35 %S A066416 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 A066416 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 A066416 0,1,0,1,0,2,0,1,0,2,0,1,0,0,0,2,0,2,0,2 %N A066416 Number of numbers m such that the sum of the anti-divisors of m is n+1. %C A066416 See A066272 for definition of anti-divisor. %H A066416 Jon Perry, <a href="http://www.users.globalnet.co.uk/~perry/maths">Anti-divisor</a> %H A066416 Jon Perry, <a href="/A066272/a066272a.html">The Anti-divisor</a> [Cached copy] %H A066416 Jon Perry, <a href="/A066272/a066272.html">The Anti-divisor: Even More Anti-Divisors</a> [Cached copy] %e A066416 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 A066416 Cf. A066417, A066418, A058838, A066241. %K A066416 nonn %O A066416 1,8 %A A066416 _Jon Perry_, Dec 28 2001