T(n,k) = number of ways to place any number of 2X1 tiles of k distinguishable colors into an nX1 grid.
1, 1, 2, 1, 3, 3, 1, 4, 5, 5, 1, 5, 7, 11, 8, 1, 6, 9, 19, 21, 13, 1, 7, 11, 29, 40, 43, 21, 1, 8
9 seqfan posts
Mon Aug 1 00:21:40 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Sun Jul 31 21:10:07 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Tue Jul 26 02:52:43 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 19:18:16 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 15:33:58 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 14:20:37 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 13:33:50 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 06:24:51 CEST 2011 [seqfan] Re: A193376 Tabl = 20 existing sequences
Mon Jul 25 03:04:01 CEST 2011 [seqfan] A193376 Tabl = 20 existing sequences
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.