A381682 - cp's OEIS frontend

A381682 Triangle read by rows: T(n,k) = number of collections of up to k+1 disjoint subsets of [n] covering [n], with [0]={}, 0<=k<=n.

n	a(n)
0	1
1	1
2	2
3	1
4	3
5	4
6	1
7	5
8	9
9	10
10	1
11	9
12	22
13	29
14	30
15	1
16	17
17	57
18	92
19	103
20	104
21	1
22	33
23	154
24	309
25	389
26	405
27	406
28	1
29	65
30	429
31	1080
32	1570
33	1731
34	1753
35	1754
36	1
37	129
38	1222
39	3889
40	6640
41	7956
42	8250
43	8279
44	8280
45	1
46	257
47	3537
48	14332
49	29053
50	38650
51	41758
52	42256
53	42293
54	42294

[1, 1, 2, 1, 3, 4, 1, 5, 9, 10, 1, 9, 22, 29, 30, 1, 17, 57, 92, 103, 104, 1, 33, 154, 309, 389, 405, 406, 1, 65, 429, 1080, 1570, 1731, 1753, 1754, 1, 129, 1222, 3889, 6640, 7956, 8250, 8279, 8280, 1, 257, 3537, 14332, 29053, 38650, 41758, 42256, 42293, 42294]

cp's OEIS Frontend

A381682 Triangle read by rows: T(n,k) = number of collections of up to k+1 disjoint subsets of [n] covering [n], with [0]={}, 0<=k<=n.

Table of values

List of values