%N a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.
%C The offset is 2 since there are infinitely many numbers (all the primes) for which A001065 = 1.
%C The graph of this sequence, shifted by 1, looks similar to that of A061358, which counts Goldbach partitions of n. - _T. D. Noe_, Dec 05 2008
%C For n > 2, a(n) <= A000009(n) as all divisor lists must have distinct values. - _Roderick MacPhee_, Sep 13 2016
%H T. D. Noe, <a href="/A048138/b048138.txt">Table of n, a(n) for n = 2..10000</a>
%e a(6) = 2 since 6 is the sum of the proper divisors of 6 and 25.
%p with(numtheory): for n from 2 to 150 do count := 0: for m from 1 to n^2 do if sigma(m) - m = n then count := count+1 fi: od: printf(`%d,`,count): od:
%o (PARI) list(n)=my(v=vector(n-1),k); for(m=4,n^2, k=sigma(m)-m; if(k>1 & k<=n, v[k-1]++)); v \\ _Charles R Greathouse IV_, Apr 21 2011
%Y Cf. A001065, A005114, A064440, A238895, A238896 (records).
%A _Naohiro Nomoto_
%E More terms from _James A. Sellers_, Feb 19 2001