Triangle read by rows: T(n,k) is the number of set partitions of {1..3n} into n sets of 3 with k disjoint strings of adjacent sets, each being a contiguous set of elements.
A334060
Triangle read by rows: T(n,k) is the number of set partitions of {1..3n} into n sets of 3 with k disjoint strings of adjacent sets, each being a contiguous set of elements.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =7a(4) =3a(5) =0a(6) =219a(7) =56a(8) =5a(9) =0a(10) =12861a(11) =2352a(12) =183a(13) =4a(14) =0a(15) =1215794a(16) =174137a(17) =11145a(18) =323a(19) =1a(20) =0a(21) =169509845a(22) =19970411a(23) =1078977a(24) =30833a(25) =334a(26) =0a(27) =0a(28) =32774737463a(29) =3280250014
External references
- oeis: A334060