A276890 - cp's OEIS frontend

A276890 Number A(n,k) of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most k elements; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	1
8	2
9	0
10	1
11	1
12	3
13	6
14	0
15	1
16	1
17	3
18	10
19	24
20	0
21	1
22	1
23	3
24	13
25	44
26	120
27	0
28	1
29	1
30	3
31	13
32	62
33	234
34	720
35	0
36	1
37	1
38	3
39	13
40	75
41	352
42	1470
43	5040
44	0
45	1
46	1
47	3
48	13
49	75
50	466
51	2348
52	10656
53	40320
54	0
55	1
56	1
57	3
58	13
59	75
60	541
61	3272
62	17880
63	87624
64	362880
65	0

[1, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 6, 0, 1, 1, 3, 10, 24, 0, 1, 1, 3, 13, 44, 120, 0, 1, 1, 3, 13, 62, 234, 720, 0, 1, 1, 3, 13, 75, 352, 1470, 5040, 0, 1, 1, 3, 13, 75, 466, 2348, 10656, 40320, 0, 1, 1, 3, 13, 75, 541, 3272, 17880, 87624, 362880, 0]

cp's OEIS Frontend

A276890 Number A(n,k) of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most k elements; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values