|
|
A252915
|
|
Number of (n+2) X (3+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
|
|
|
90512, 566649, 5247300, 54457598, 606913688, 6778023822, 76682086492, 869698248167, 9878822337856, 112256468346214, 1276115781362754, 14507747043563015, 164948548762618549, 1875445243541415216
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..1..2..0..2....0..1..0..2..0....0..1..2..1..1....0..0..1..1..2
..2..1..1..2..2....0..3..1..3..2....0..0..3..2..2....3..0..2..1..0
..2..1..1..0..0....0..1..0..2..0....2..1..2..1..1....0..1..1..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|