32774737463
domain: N
Appears in sequences
- 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.at n=28A334056
- 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.at n=28A334060