|
|
A265421
|
|
T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no equal horizontal, vertical, diagonal or antidiagonal neighbors and new values introduced sequentially from 0.
|
|
4
|
|
|
1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 4, 1, 0, 0, 0, 1, 48, 1, 0, 0, 0, 7, 225, 584, 1, 0, 0, 0, 1, 8708, 86226, 8096, 1, 0, 0, 0, 19, 79026, 26269068, 25009492, 127296, 1, 0, 0, 0, 1, 2108980, 7017652689, 117840778362, 8099337021, 2241856, 1, 0, 0, 0, 67, 28314236
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,14
|
|
COMMENTS
|
Table starts
.1.......0..........0............0..........0.............0........0..0.0.0.0
.1.......0..........0............0..........0.............0........0..0.0.0
.1.......0..........0............0..........0.............0........0..0.0
.1.......4..........1............7..........1............19........1.67
.1......48........225.........8708......79026.......2108980.28314236
.1.....584......86226.....26269068.7017652689.2116863604518
.1....8096...25009492.117840778362
.1..127296.8099337021
.1.2241856
.1
|
|
LINKS
|
|
|
FORMULA
|
Empirical for row n:
n=4: a(n) = 1 for odd n; a(n) = 2^(n-2)+3 for even n.
|
|
EXAMPLE
|
Some solutions for n=5, k=4
..0..1..2..0....0..1..2..1....0..1..2..3....0..1..2..3....0..1..2..0
..3..4..3..4....3..4..3..0....2..3..4..0....2..4..0..4....3..4..3..4
..0..2..1..0....1..0..2..4....4..1..2..1....3..1..2..1....0..2..1..2
..3..4..3..2....3..4..3..1....0..3..4..3....4..0..4..0....4..3..4..3
..1..2..1..4....2..0..2..4....4..1..0..2....3..2..3..1....1..2..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|