|
%I #6 Oct 13 2021 00:04:15
%S 17424,120982,809934,4053903,19854533,80967696,324243821,1156109395,
%T 4058563375,13208174936,42390687109,129441198533,390073441352,
%U 1138410030575,3278903374500,9262644388422,25810995719109,71203349641035
%N 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.
%C Column 6 of A251467.
%H R. H. Hardin, <a href="/A251465/b251465.txt">Table of n, a(n) for n = 1..78</a>
%e Some solutions for n=2
%e ..0..0..1..0..1..1..1....0..1..0..2..1..0..0....0..2..0..2..0..2..2
%e ..1..2..2..2..2..1..2....0..1..0..0..0..2..1....0..0..0..1..2..1..2
%e ..2..0..1..0..1..1..1....0..1..0..2..1..2..2....0..2..0..2..0..2..2
%Y Cf. A251467.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 02 2014
| 