A255874 - cp's OEIS frontend

A255874 Triangular array T: T(n,k) = number of subset S of {1,2,...,n+1} such that |S| > 1 and max(S) = k, where S is the set {x(2)-x(1), x(3)-x(2), ..., x(h+1)-x(h)} when the elements of S are written as x(1) < x(2) < ... < x(h+1).

n	a(n)
1	1
2	3
3	1
4	6
5	4
6	1
7	10
8	11
9	4
10	1
11	15
12	25
13	12
14	4
15	1
16	21
17	51
18	31
19	12
20	4
21	1
22	28
23	97
24	73
25	32
26	12
27	4
28	1
29	36
30	176
31	162
32	79
33	32
34	12
35	4
36	1
37	45
38	309
39	345
40	185
41	80
42	32
43	12
44	4
45	1
46	55
47	530
48	713
49	418
50	191
51	80
52	32
53	12
54	4
55	1
56	66
57	894
58	1441
59	920
60	441
61	192
62	80
63	32
64	12
65	4
66	1

[1, 3, 1, 6, 4, 1, 10, 11, 4, 1, 15, 25, 12, 4, 1, 21, 51, 31, 12, 4, 1, 28, 97, 73, 32, 12, 4, 1, 36, 176, 162, 79, 32, 12, 4, 1, 45, 309, 345, 185, 80, 32, 12, 4, 1, 55, 530, 713, 418, 191, 80, 32, 12, 4, 1, 66, 894, 1441, 920, 441, 192, 80, 32, 12, 4, 1]

cp's OEIS Frontend

A255874 Triangular array T: T(n,k) = number of subset S of {1,2,...,n+1} such that |S| > 1 and max(S) = k, where S is the set {x(2)-x(1), x(3)-x(2), ..., x(h+1)-x(h)} when the elements of S are written as x(1) < x(2) < ... < x(h+1).

Table of values

List of values

cp's OEIS Frontend

A255874 Triangular array T: T(n,k) = number of subset S of {1,2,...,n+1} such that |S| > 1 and max(S*) = k, where S* is the set {x(2)-x(1), x(3)-x(2), ..., x(h+1)-x(h)} when the elements of S are written as x(1) < x(2) < ... < x(h+1).

Table of values

List of values

A255874 Triangular array T: T(n,k) = number of subset S of {1,2,...,n+1} such that |S| > 1 and max(S) = k, where S is the set {x(2)-x(1), x(3)-x(2), ..., x(h+1)-x(h)} when the elements of S are written as x(1) < x(2) < ... < x(h+1).