|
|
A252989
|
|
Number of (n+2)X(3+2) 0..2 arrays with every consecutive three elements in every row and column having exactly 2 distinct values, in every diagonal 1 or 2 distinct values, in every antidiagonal 2 or 3 distinct values, and new values 0 upwards introduced in row major order
|
|
1
|
|
|
3548, 24001, 176608, 1350439, 10388030, 80232248, 620852707, 4808767844, 37257749515, 288739455911, 2237986443070, 17347242804844, 134469582550424, 1042391444409217, 8080557887620007, 62640695434924075, 485595751974289946
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..0..0..2....0..0..1..0..1....0..0..1..1..2....0..0..1..1..0
..1..0..1..1..2....2..0..0..2..2....2..0..0..2..2....1..1..0..0..1
..1..1..0..0..1....2..1..1..2..2....0..1..1..2..1....0..0..1..0..1
..0..1..1..0..1....1..0..1..1..0....0..0..1..1..2....1..0..0..2..0
..1..0..1..1..0....1..0..0..2..0....1..0..0..1..1....0..1..1..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|