A287640 - cp's OEIS frontend

A287640 Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	4
6	1
7	13
8	1
9	1
10	41
11	9
12	1
13	1
14	131
15	59
16	11
17	1
18	1
19	428
20	344
21	88
22	15
23	1
24	1
25	1429
26	1906
27	634
28	146
29	23
30	1
31	1
32	4861
33	10345
34	4389
35	1231
36	280
37	39
38	1
39	1
40	16795
41	55901
42	30006
43	9835
44	2763
45	602
46	71
47	1
48	1
49	58785
50	303661
51	205420
52	77178
53	25014
54	6967
55	1408
56	135
57	1

[1, 1, 1, 1, 1, 4, 1, 13, 1, 1, 41, 9, 1, 1, 131, 59, 11, 1, 1, 428, 344, 88, 15, 1, 1, 1429, 1906, 634, 146, 23, 1, 1, 4861, 10345, 4389, 1231, 280, 39, 1, 1, 16795, 55901, 30006, 9835, 2763, 602, 71, 1, 1, 58785, 303661, 205420, 77178, 25014, 6967, 1408, 135, 1]

cp's OEIS Frontend

A287640 Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.

Table of values

List of values