A276891 - cp's OEIS frontend

A276891 Number T(n,k) of ordered set partitions of [n] where k is minimal such that for each block b the smallest integer interval containing b has at most k elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	1
6	0
7	6
8	4
9	3
10	0
11	24
12	20
13	18
14	13
15	0
16	120
17	114
18	118
19	114
20	75
21	0
22	720
23	750
24	878
25	924
26	870
27	541
28	0
29	5040
30	5616
31	7224
32	8152
33	8760
34	7818
35	4683
36	0
37	40320
38	47304
39	65514
40	79682
41	90084
42	94560
43	81078
44	47293
45	0
46	362880
47	443400
48	652446
49	845874
50	998560
51	1135776
52	1148016
53	954474
54	545835

[1, 0, 1, 0, 2, 1, 0, 6, 4, 3, 0, 24, 20, 18, 13, 0, 120, 114, 118, 114, 75, 0, 720, 750, 878, 924, 870, 541, 0, 5040, 5616, 7224, 8152, 8760, 7818, 4683, 0, 40320, 47304, 65514, 79682, 90084, 94560, 81078, 47293, 0, 362880, 443400, 652446, 845874, 998560, 1135776, 1148016, 954474, 545835]

cp's OEIS Frontend

A276891 Number T(n,k) of ordered set partitions of [n] where k is minimal such that for each block b the smallest integer interval containing b has at most k elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values