A265170 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or vertical neighbors and new values introduced sequentially from 0.
1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 6, 21, 1, 0, 1, 19, 447, 186, 1, 0, 1, 70, 11223, 40476, 2113, 1, 0, 1, 264, 305863, 10723968, 5693966, 27856, 1, 0, 1, 1038, 8862785, 3152470670, 19442592272, 1109065142, 422481, 1, 0, 1, 4155, 267827143, 995141926013
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..1..2..1....0..1..2..1....0..1..2..0....0..1..2..3....0..1..0..2 ..3..0..3..2....3..0..1..2....1..0..1..3....2..3..0..1....3..2..1..3 ..0..1..2..3....2..3..2..3....2..3..0..2....0..1..3..2....2..0..3..0 ..3..2..1..0....0..1..3..0....3..2..3..1....3..2..0..1....3..1..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Comments