Triangle read by rows: T(n,k) is the number of ordered partitions of [n] into k nonempty subsets, in which the first subset has size at least 2, n >= 1 and 1 <= k <= n.
A348576
Triangle read by rows: T(n,k) is the number of ordered partitions of [n] into k nonempty subsets, in which the first subset has size at least 2, n >= 1 and 1 <= k <= n.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =1a(4) =3a(5) =0a(6) =1a(7) =10a(8) =12a(9) =0a(10) =1a(11) =25a(12) =80a(13) =60a(14) =0a(15) =1a(16) =56a(17) =360a(18) =660a(19) =360a(20) =0a(21) =1a(22) =119a(23) =1372a(24) =4620a(25) =5880a(26) =2520a(27) =0a(28) =1a(29) =246
External references
- oeis: A348576