|
| |
|
|
A251465
|
|
Number of (n+1) X (6+1) 0..2 arrays with every 2 X 2 subblock summing to a prime and those sums nondecreasing in every row and column.
|
|
1
|
|
|
|
17424, 120982, 809934, 4053903, 19854533, 80967696, 324243821, 1156109395, 4058563375, 13208174936, 42390687109, 129441198533, 390073441352, 1138410030575, 3278903374500, 9262644388422, 25810995719109, 71203349641035
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..0..1..0..1..1..1....0..1..0..2..1..0..0....0..2..0..2..0..2..2
..1..2..2..2..2..1..2....0..1..0..0..0..2..1....0..0..0..1..2..1..2
..2..0..1..0..1..1..1....0..1..0..2..1..2..2....0..2..0..2..0..2..2
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
