A349776 - cp's OEIS frontend

A349776 Triangle read by rows: T(n,k) is the number of partitions of set [n] into a set of at most k lists, with 0 <= k <= n. Also called broken permutations.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	3
6	0
7	6
8	12
9	13
10	0
11	24
12	60
13	72
14	73
15	0
16	120
17	360
18	480
19	500
20	501
21	0
22	720
23	2520
24	3720
25	4020
26	4050
27	4051
28	0
29	5040
30	20160
31	32760
32	36960
33	37590
34	37632
35	37633
36	0
37	40320
38	181440
39	322560
40	381360
41	393120
42	394296
43	394352
44	394353

[1, 0, 1, 0, 2, 3, 0, 6, 12, 13, 0, 24, 60, 72, 73, 0, 120, 360, 480, 500, 501, 0, 720, 2520, 3720, 4020, 4050, 4051, 0, 5040, 20160, 32760, 36960, 37590, 37632, 37633, 0, 40320, 181440, 322560, 381360, 393120, 394296, 394352, 394353]

cp's OEIS Frontend

A349776 Triangle read by rows: T(n,k) is the number of partitions of set [n] into a set of at most k lists, with 0 <= k <= n. Also called broken permutations.

Table of values

List of values