Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.

A334059

Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =2a(5) =0a(6) =5a(7) =8a(8) =2a(9) =0a(10) =36a(11) =49a(12) =19a(13) =1a(14) =0a(15) =329a(16) =414a(17) =180a(18) =22a(19) =0a(20) =0a(21) =3655a(22) =4398a(23) =1986a(24) =344a(25) =12a(26) =0a(27) =0a(28) =47844a(29) =55897

External references