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 A325768 #5 May 22 2019 21:00:51
%S A325768 1,1,1,2,2,3,3,5,5,8,7,11,12,15,15,23,22,29,32,40,42,55,56,71,75,92,
%T A325768 100,124,128,152,167,198,212,255,269,315,343,392,428,501,529,615,665,
%U A325768 757,812,937,1002,1142,1238,1385,1490,1701,1808,2038,2200,2476
%N A325768 Number of integer partitions of n for which every restriction to a subinterval has a different sum.
%C A325768 Also the number of Golomb rulers of length n whose consecutive marks are separated by weakly decreasing distances.
%C A325768 The Heinz numbers of these partitions are given by A325779.
%e A325768 The a(1) = 1 through a(9) = 8 partitions:
%e A325768 (1) (2) (3) (4) (5) (6) (7) (8) (9)
%e A325768 (21) (31) (32) (42) (43) (53) (54)
%e A325768 (41) (51) (52) (62) (63)
%e A325768 (61) (71) (72)
%e A325768 (421) (521) (81)
%e A325768 (432)
%e A325768 (531)
%e A325768 (621)
%t A325768 Table[Length[Select[IntegerPartitions[n],UnsameQ@@ReplaceList[#,{___,s__,___}:>Plus[s]]&]],{n,0,30}]
%Y A325768 Cf. A000041, A002033, A103300, A143823, A169942, A325676, A325687, A325769, A325779.
%K A325768 nonn
%O A325768 0,4
%A A325768 _Gus Wiseman_, May 21 2019