A269646 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and equal-up in every column.
1, 1, 2, 1, 6, 6, 1, 14, 74, 24, 1, 34, 574, 1880, 120, 1, 92, 4564, 68876, 80316, 720, 1, 258, 41526, 2316638, 18375702, 5141864, 5040, 1, 722, 419516, 94747953, 3291772332, 9213264418, 458608016, 40320, 1, 2022, 4351224, 4581555620
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..0..0. .1..1..2..1. .0..2..2..2. .0..1..2..2. .2..2..1..1 ..2..2..2..1. .2..0..0..2. .1..2..1..1. .1..2..1..0. .1..0..0..2 ..2..0..0..1. .2..1..0..0. .1..0..0..0. .2..1..0..0. .1..2..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Comments