T(n,k) = number of ways to place any number of 3X1 tiles of k distinguishable colors into an nX1 grid.
1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 5, 4, 1, 1, 5, 7, 7, 6, 1, 1, 6, 9, 10, 13, 9, 1, 1, 7, 11
2 seqfan posts
Mon Aug 1 00:21:40 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences