|
|
A252907
|
|
Number of (n+2)X(3+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
|
|
|
5567, 42647, 361750, 3321526, 31101826, 293166855, 2779386634, 26422127321, 251365182149, 2393376335753, 22799665288410, 217194895643722, 2069420807703495, 19719401115769839, 187896935466387368
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..0..1..1..2....0..1..0..1..1....0..1..1..2..1....0..1..0..1..0
..3..3..1..3..1....2..1..1..3..1....2..2..0..2..2....0..1..0..0..1
..3..0..0..1..1....2..0..0..1..0....2..2..0..0..2....1..2..1..1..0
..2..0..0..3..3....3..0..0..1..1....0..0..2..2..0....0..1..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|