|
|
A251466
|
|
Number of (n+1)X(7+1) 0..2 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column
|
|
1
|
|
|
50306, 373380, 2678350, 14306546, 75006354, 324243821, 1378354755, 5171467239, 19112759465, 64992838581, 218002148541, 691112888352, 2162935670566, 6516410789833, 19386252148251, 56253833823574, 161157974255043
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..1..1..2..2..2..2..2..2....1..1..2..2..2..1..1..2....1..0..2..0..2..1..2..0
..2..1..1..0..1..0..1..2....2..1..1..0..1..1..2..2....2..0..1..2..1..1..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|