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 4n.

A334057

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 4n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =31a(4) =3a(5) =1a(6) =5474a(7) =288a(8) =12a(9) =1a(10) =2554091a(11) =72026a(12) =1476a(13) =31a(14) =1a(15) =2502018819a(16) =43635625a(17) =508610a(18) =5505a(19) =65a(20) =1a(22) =52673302074a(23) =394246455a(24) =2559565a(25) =16710a(26) =120a(27) =1a(30) =580589062179a(31) =2504572910a(32) =10288390

External references