|
|
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.
|
|
7
|
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Table starts
.1....1........1............1................1....................1
.1....2........4............8...............16...................32
.1...10.......92..........888.............8880................91180
.1...68.....4716.......359172.........29189088...........2481226704
.1..604...414716....327847656.....284341627344......262625535902888
.1.6584.55210372.559450092072.6395116792255680.79291881287786838864
|
|
LINKS
|
|
|
EXAMPLE
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|