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

A334058

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =121a(4) =4a(5) =1a(6) =124760a(7) =1347a(8) =18a(9) =1a(10) =486854621a(11) =2001548a(12) =8154a(13) =52a(14) =1a(16) =10231953233a(17) =17045774a(18) =35542a(19) =121a(20) =1a(23) =112619668659a(24) =102416812a(25) =124881a(26) =246a(27) =1a(31) =863827126967a(32) =486979381a(33) =375627a(34) =455a(35) =1

External references