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.

A333223 Numbers k such that every distinct consecutive subsequence of the k-th composition in standard order has a different sum.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 5
7 6
8 7
9 8
10 9
11 10
12 12
13 15
14 16
15 17
16 18
17 19
18 20
19 21
20 24
21 26
22 28
23 31
24 32
25 33
26 34
27 35
28 36
29 40
30 41
31 42
32 48
33 50
34 56
35 63
36 64
37 65
38 66
39 67
40 68
41 69
42 70
43 71
44 72
45 73
46 74
47 80
48 81
49 84
50 85
51 88
52 96
53 98
54 100
55 104
56 106
57 112
58 120
59 127
60 128
61 129
62 130
63 131
64 132
65 133

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 16, 17, 18, 19, 20, 21, 24, 26, 28, 31, 32, 33, 34, 35, 36, 40, 41, 42, 48, 50, 56, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 80, 81, 84, 85, 88, 96, 98, 100, 104, 106, 112, 120, 127, 128, 129, 130, 131, 132, 133]