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 A363446 #44 Aug 05 2023 21:56:14
%S A363446 1,2,4,5,8,10,14,21,25,26,28,31,36,38,55,56,66,68,88,91,92,94,102,125,
%T A363446 127,136,140,158,162,164,180,182,201,217,220,226,228,240,241,259,261,
%U A363446 275,314,331,337,342,356,366,380,391,408,432,441,444,456,469,478,548,560,565,574,577,580,586,628,639,696,701,707,730,731,732,733,752,759,773,849,877,890,922
%N A363446 Increasing sequence such that a(1) = 1 and a(n) is the least integer such that every segment of the sequence a(1),a(2),...,a(n) has a unique sum of elements.
%C A363446 A segment is a subsequence given by consecutive elements.
%e A363446 The smallest candidate for a(3) is 3, but the sequence (1,2,3) has two segments with equal sums, namely (1,2) and (3). The next candidate is 4 and every segment of the sequence (1,2,4) has a unique sum, so a(3) = 4.
%Y A363446 If we omit the condition that {a(n)} is increasing, we get A101274.
%Y A363446 Cf. A276661.
%K A363446 nonn
%O A363446 1,2
%A A363446 _Bartlomiej Pawlik_, Jul 09 2023