A269336 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern equal-up in every row and column.
1, 1, 2, 1, 6, 6, 1, 14, 74, 24, 1, 34, 852, 1880, 120, 1, 78, 10210, 152922, 80316, 720, 1, 178, 124466, 13745475, 62038644, 5141864, 5040, 1, 398, 1539739, 1301306034, 55575194220, 47286888510, 458608016, 40320, 1, 882, 19271229, 128342085219
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..2..0..0. .1..2..1..2. .0..1..2..1. .2..1..0..0. .1..2..1..2 ..0..1..2..1. .0..2..0..0. .0..2..1..0. .2..0..1..2. .0..2..0..1 ..1..2..2..0. .2..0..1..1. .0..2..2..1. .1..0..1..2. .0..1..2..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..41
Comments