%I
%S 7,13,15,22,23,25,27,29,30,31,39,42,43,45,46,47,49,51,53,54,55,57,58,
%T 59,60,61,62,63,71,75,76,77,78,79,82,83,85,86,87,89,90,91,92,93,94,95,
%U 97,99,101,102,103,105,106,107,108,109,110,111,113,114,115,117,118,119
%N Number of partitions into distinct parts, with some subpartitions having equal sums. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...
%C Partition encoding as in A029931. Complement of A059519.
%e 13=1+4+8 so Partition(13) = [1,3,4], whose subsums are 0,1,3,4,5,7 and 13, with 4 twice (once from 1+3 and once from 4 by itself).
%Y A029931, A059519.
%K easy,nonn
%O 1,1
%A _Marc LeBrun_, Jan 19 2001
