|
|
A252990
|
|
Number of (n+2)X(4+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
|
|
|
15395, 136697, 1350439, 14090659, 147972602, 1564485159, 16592413774, 176117806795, 1870443952223, 19874156580697, 211183824250129, 2244286096397298, 23852873329425588, 253514027450350026
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..1..1..2..1..1....0..1..0..0..1..1....0..1..0..1..0..0....0..1..1..2..2..0
..0..0..1..0..0..2....1..2..1..1..2..1....0..1..0..0..2..0....1..2..2..0..2..2
..2..1..2..2..0..2....0..1..0..1..1..0....2..2..1..1..2..1....1..1..2..2..1..2
..0..1..1..2..2..0....0..1..0..0..1..0....2..2..0..0..1..0....0..1..1..0..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|