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 A325864 #16 Mar 23 2021 09:00:24 %S A325864 1,2,4,7,13,22,36,56,91,135,211,307,446,625,882,1194,1677,2238,3031, %T A325864 4001,5460,6995,9302,11921,15424,19554,25032,31005,39170,48251,59917, %U A325864 73093,90831,109271,134049,160922,196109,234179,284157,335933,408390,482597,575109 %N A325864 Number of subsets of {1..n} of which every subset has a different sum. %H A325864 Fausto A. C. Cariboni, <a href="/A325864/b325864.txt">Table of n, a(n) for n = 0..150</a> (terms 0..60 from Giovanni Resta) %e A325864 The a(0) = 1 through a(4) = 13 subsets: %e A325864 {} {} {} {} {} %e A325864 {1} {1} {1} {1} %e A325864 {2} {2} {2} %e A325864 {1,2} {3} {3} %e A325864 {1,2} {4} %e A325864 {1,3} {1,2} %e A325864 {2,3} {1,3} %e A325864 {1,4} %e A325864 {2,3} %e A325864 {2,4} %e A325864 {3,4} %e A325864 {1,2,4} %e A325864 {2,3,4} %t A325864 Table[Length[Select[Subsets[Range[n]],UnsameQ@@Plus@@@Subsets[#]&]],{n,0,10}] %Y A325864 Cf. A002033, A108917, A143823, A196723, A275972. %Y A325864 Cf. A325860, A325865, A325866, A325867, A325877, A325878, A325879, A325880. %K A325864 nonn %O A325864 0,2 %A A325864 _Gus Wiseman_, Jun 01 2019 %E A325864 a(18)-a(42) from _Alois P. Heinz_, Jun 03 2019