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.

A334967 Numbers k such that the every subsequence (not necessarily contiguous) of the k-th composition in standard order (A066099) 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 42
31 48
32 56
33 63
34 64
35 65
36 66
37 67
38 68
39 69
40 70
41 71
42 72
43 73
44 74
45 80
46 81
47 84
48 85
49 88
50 96
51 98
52 100
53 104
54 106
55 112
56 120
57 127
58 128
59 129
60 130
61 131
62 132
63 133
64 134

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, 42, 48, 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, 134]