A265241 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0.
1, 1, 1, 1, 2, 1, 1, 4, 10, 1, 1, 8, 92, 68, 1, 1, 16, 888, 4716, 604, 1, 1, 32, 8880, 359172, 414716, 6584, 1, 1, 64, 91180, 29189088, 327847656, 55210372, 85048, 1, 1, 128, 955320, 2481226704, 284341627344, 559450092072, 10337500044, 1269680, 1, 1, 256
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..1..1....0..1..2..2....0..0..1..1....0..1..2..1....0..1..2..1 ..2..0..2..0....2..1..0..2....2..0..2..0....0..1..2..0....2..0..0..0 ..2..1..1..2....0..1..1..0....1..1..2..2....2..0..2..1....2..1..1..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..71
Comments