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 A065219 #21 Oct 12 2017 03:37:35
%S A065219 0,1,2,5,7,10,34,278,751,2157,22208,676327,2225346,23259536,265050967,
%T A065219 39161483067,70455119174849,776384598617893,133991542908557129,
%U A065219 21819590324155207874,263763825614848727692,12883245190231409112736,661394651111310011564685
%N A065219 Number of subsets of proper divisors of numbers in A065218 summing to the number.
%C A065219 The numbers themselves are in A065218.
%F A065219 a(n) = A065205(A065218(n)).
%e A065219 Proper divisors of 12 are {1, 2, 3, 4, 6}. Two subsets of this sum to 12: {2, 4, 6} and {1, 2, 3, 6} - more than any smaller number, so 2 is in the sequence (and 12 is in A065218).
%t A065219 Union@ FoldList[Max, Array[Block[{dd = Most@ Divisors@ #, c, cc}, cc = Array[c, Length@ dd]; Length@{ ToRules[Reduce[And @@ (0 <= # <= 1 &) /@ cc && dd.cc == #, cc, Integers]]}] &, 360]] (* _Michael De Vlieger_, Oct 01 2017, after Jean-François Alcover at A065205 *)
%Y A065219 Cf. A065218, A064771, A063205, A005835, A002182, A004394.
%K A065219 nonn
%O A065219 1,3
%A A065219 _Jud McCranie_, Oct 21 2001
%E A065219 Extended by _Max Alekseyev_, May 29 2009
%E A065219 Initial 0 prepended and offset corrected by _Amiram Eldar_, Oct 01 2017