|
|
A252992
|
|
Number of (n+2)X(6+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
|
|
|
291448, 4486592, 80232248, 1564485159, 30940948009, 618832488265, 12432368877884, 250255753857694, 5041787244222098, 101631445454212323, 2049184800689121326, 41322113536941980635, 833338675294493304917
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..1..1..2..2..1..1..2....0..1..0..0..2..2..1..2....0..1..1..2..1..2..1..1
..0..2..2..1..2..1..1..2....0..1..0..0..1..1..2..1....0..0..1..1..0..1..1..0
..1..1..2..2..0..2..2..0....1..2..1..1..2..1..2..2....2..0..0..2..0..2..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|