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