Number T(n,k) of ordered set partitions of [n] into k blocks such that equal-sized blocks are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A285824
Number T(n,k) of ordered set partitions of [n] into k blocks such that equal-sized blocks are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =6a(9) =1a(10) =0a(11) =1a(12) =11a(13) =18a(14) =1a(15) =0a(16) =1a(17) =30a(18) =75a(19) =40a(20) =1a(21) =0a(22) =1a(23) =52a(24) =420a(25) =350a(26) =75a(27) =1a(28) =0a(29) =1
External references
- oeis: A285824