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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251462 Number of (n+1)X(3+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:45:40

%S 602,3142,15719,62309,239572,809934,2678350,8222849,24796090,71644353,

%T 203613185,565710173,1545775344,4185949130,11136965910,29652176113,

%U 77452013880,203909911308,525772216775,1373878022187,3509862980888

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

%C Column 3 of A251467

%H R. H. Hardin, <a href="/A251462/b251462.txt">Table of n, a(n) for n = 1..210</a>

%H R. H. Hardin, <a href="/A251462/a251462.txt">Empirical recurrence of order 61</a>

%F Empirical recurrence of order 61 (see link above)

%e Some solutions for n=4

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

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

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

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

%e ..1..0..2..1....2..1..2..2....0..1..2..1....2..0..1..2....1..0..2..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.

Last modified September 22 00:10 EDT 2023. Contains 365503 sequences. (Running on oeis4.)