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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A251464 Number of (n+1)X(5+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:47:38

%S 5926,38509,239572,1125843,5145888,19854533,75006354,255126617,

%T 853011914,2668157253,8219717614,24279045133,70676062040,200592222675,

%U 560962999717,1547846775013,4205200806698,11371630681863,30246462359503

%N Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column

%C Column 5 of A251467

%H R. H. Hardin, <a href="/A251464/b251464.txt">Table of n, a(n) for n = 1..179</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 02 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 May 7 11:47 EDT 2024. Contains 372302 sequences. (Running on oeis4.)