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!)
A251564 Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock summing to a prime. 1

%I #6 Oct 02 2021 15:24:25

%S 634130,100477236,15941867804,2532196250950,402177783997408,

%T 63887515354394210,10148236457554340550,1612097555345198160542,

%U 256082560088864495392018,40680239450040683156455136

%N Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock summing to a prime.

%C Column 3 of A251567.

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

%e Some solutions for n=1

%e ..0..4..0..7....2..6..2..2....0..6..0..2....2..6..6..5....0..0..1..3

%e ..6..1..6..4....6..3..6..3....0..5..0..3....2..1..4..4....2..3..7..0

%Y Cf. A251567.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 04 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 April 18 13:10 EDT 2024. Contains 371780 sequences. (Running on oeis4.)