|
|
A252906
|
|
Number of (n+2)X(2+2) 0..3 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
|
|
|
1125, 6699, 42647, 288263, 1984711, 13720545, 95366448, 664294791, 4628430243, 32278030363, 225170352448, 1570680525096, 10958602605331, 76461093301994, 533470122592798, 3722231877540721, 25971571135506891, 181212232746263516
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..1..0..1....0..1..1..2....0..1..1..2....0..0..1..0....0..1..0..1
..1..2..2..0....2..0..2..0....2..0..0..1....1..0..0..1....0..1..1..2
..1..1..2..1....2..0..2..2....0..1..0..1....0..1..1..0....1..3..1..1
..2..2..0..0....0..2..0..2....0..1..1..2....1..0..0..1....0..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|