|
|
A252950
|
|
Number of (n+2)X(6+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order
|
|
1
|
|
|
193059, 1192149, 9627372, 90331596, 919418760, 9729661266, 104852356227, 1141808774769, 12498557877783, 137122697754648, 1506265056158256, 16556855861702691, 182042797661939664, 2001875638434886899
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..1..1..2..1..1..2....0..1..0..0..2..2..0..2....0..0..1..0..1..1..2..2
..1..0..1..0..0..2..0..2....0..1..0..1..0..0..2..0....0..1..1..2..1..1..0..0
..0..2..2..0..0..1..1..0....1..0..1..0..0..2..2..0....1..1..0..0..2..0..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|