|
|
A252920
|
|
Number of (3+2)X(n+2) 0..3 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order
|
|
1
|
|
|
35674, 418853, 5247300, 67554413, 904486202, 12006682353, 160456041308, 2161866908346, 29002697628640, 389999512255547, 5251871898866981, 70639675506138194, 950670868788010336, 12799386451710340286
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..1..1....0..1..1....0..1..1....0..0..1....0..0..1....0..0..1....0..1..2
..2..0..1....0..2..1....0..0..1....2..0..2....2..0..3....0..1..1....1..1..2
..0..0..1....2..1..2....1..0..2....0..2..2....0..3..3....0..1..1....1..0..0
..0..0..2....2..2..1....1..2..2....0..2..0....0..3..3....0..1..1....0..1..0
..0..3..2....3..1..1....0..2..1....1..0..2....2..3..0....2..0..0....1..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|