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.
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.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =3a(6) =0a(7) =6a(8) =12a(9) =13a(10) =0a(11) =24a(12) =60a(13) =72a(14) =73a(15) =0a(16) =120a(17) =360a(18) =480a(19) =500a(20) =501a(21) =0a(22) =720a(23) =2520a(24) =3720a(25) =4020a(26) =4050a(27) =4051a(28) =0a(29) =5040
External references
- oeis: A349776