|
|
A265373
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.
|
|
5
|
|
|
1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 10, 1, 0, 0, 1, 32, 99, 1, 0, 0, 1, 236, 4954, 1146, 1, 0, 0, 1, 1238, 363850, 878953, 15422, 1, 0, 0, 1, 7968, 25964546, 860077644, 192333677, 237135, 1, 0, 0, 1, 49214, 2006263350, 919241950442, 3040856393843, 53404173562
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,14
|
|
COMMENTS
|
Table starts
.1.......0...........0.............0............0..........0............0
.1.......0...........0.............0............0..........0............0
.1.......1...........1.............1............1..........1............1
.1......10..........32...........236.........1238.......7968........49214
.1......99........4954........363850.....25964546.2006263350.159927435847
.1....1146......878953.....860077644.919241950442
.1...15422...192333677.3040856393843
.1..237135.53404173562
.1.4106680
.1
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..1..2..0....0..1..2..3....0..1..2..0....0..1..2..3....0..1..2..1
..2..3..1..3....3..0..1..2....3..0..3..2....2..3..0..2....2..0..3..2
..0..2..0..2....1..3..0..1....1..2..1..3....1..2..1..0....3..1..0..3
..1..3..1..3....0..2..3..2....3..0..2..1....3..0..3..1....0..3..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|