Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 3n.

A334056

Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 3n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =7a(4) =2a(5) =1a(6) =219a(7) =53a(8) =7a(9) =1a(10) =12861a(11) =2296a(12) =226a(13) =16a(14) =1a(15) =1215794a(16) =171785a(17) =13080a(18) =710a(19) =30a(20) =1a(21) =169509845a(22) =19796274a(23) =1228655a(24) =53740a(25) =1835a(26) =50a(27) =1a(28) =32774737463a(29) =3260279603

External references