login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #4 Dec 02 2014 18:49:08

%S 50306,373380,2678350,14306546,75006354,324243821,1378354755,

%T 5171467239,19112759465,64992838581,218002148541,691112888352,

%U 2162935670566,6516410789833,19386252148251,56253833823574,161157974255043

%N 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

%C Column 7 of A251467

%H R. H. Hardin, <a href="/A251466/b251466.txt">Table of n, a(n) for n = 1..35</a>

%e Some solutions for n=1

%e ..1..1..2..2..2..2..2..2....1..1..2..2..2..1..1..2....1..0..2..0..2..1..2..0

%e ..2..1..1..0..1..0..1..2....2..1..1..0..1..1..2..2....2..0..1..2..1..1..1..2

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 02 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 21:38 EDT 2024. Contains 376078 sequences. (Running on oeis4.)