A269505 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and column.
1, 1, 2, 1, 6, 4, 1, 14, 54, 8, 1, 34, 420, 600, 16, 1, 92, 3088, 18332, 9102, 32, 1, 258, 25226, 480440, 1261420, 188472, 64, 1, 722, 239994, 13522204, 135988690, 134871120, 5118012, 128, 1, 2022, 2338286, 492613956, 14911788936, 69071316466
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..0..0..0. .1..2..0..0. .1..0..0..1. .0..0..1..0. .1..1..2..2 ..2..2..1..0. .1..1..2..2. .0..2..2..2. .2..2..1..1. .2..2..1..0 ..2..2..1..1. .0..0..2..1. .0..2..1..1. .0..2..2..1. .0..0..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Comments