cp's OEIS Frontend

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.

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.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 8
6 10
7 14
8 21
9 25
10 26
11 28
12 31
13 36
14 38
15 55
16 56
17 66
18 68
19 88
20 91
21 92
22 94
23 102
24 125
25 127
26 136
27 140
28 158
29 162
30 164
31 180
32 182
33 201
34 217
35 220
36 226
37 228
38 240
39 241
40 259
41 261
42 275
43 314
44 331
45 337
46 342
47 356
48 366
49 380
50 391
51 408
52 432
53 441
54 444
55 456
56 469
57 478
58 548
59 560
60 565
61 574
62 577
63 580
64 586
65 628
66 639
67 696
68 701
69 707
70 730
71 731
72 732
73 733
74 752
75 759
76 773
77 849
78 877
79 890
80 922

List of values

[1, 2, 4, 5, 8, 10, 14, 21, 25, 26, 28, 31, 36, 38, 55, 56, 66, 68, 88, 91, 92, 94, 102, 125, 127, 136, 140, 158, 162, 164, 180, 182, 201, 217, 220, 226, 228, 240, 241, 259, 261, 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]