Triangle read by rows: T(n,k) is the number of set partitions of {1..4n} into n sets of 4 with k disjoint strings of adjacent sets, each being a contiguous set of elements.
A334061
Triangle read by rows: T(n,k) is the number of set partitions of {1..4n} into n sets of 4 with k disjoint strings of adjacent sets, each being a contiguous set of elements.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =31a(4) =4a(5) =0a(6) =5474a(7) =292a(8) =9a(9) =0a(10) =2554091a(11) =72318a(12) =1206a(13) =10a(14) =0a(15) =2502018819a(16) =43707943a(17) =438987a(18) =2871a(19) =5a(20) =0a(22) =52717010017a(23) =351487598a(24) =1622954a(25) =4355a(26) =1a(27) =0a(30) =528618296314a(31) =1764575884a(32) =4080889
External references
- oeis: A334061