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

%I #4 Dec 02 2014 19:00:01

%S 75962,4789458,305835002,19627202794,1260430729632,80982143877530,

%T 5202945849966534,334318881406658424,21480721926534939516,

%U 1380281369290307662180,88688226067972886885132

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

%C Column 3 of A251474

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

%e Some solutions for n=1

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

%e ..0..0..0..0....5..0..2..3....2..5..5..4....4..2..2..0....5..5..3..3

%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 April 19 04:29 EDT 2024. Contains 371782 sequences. (Running on oeis4.)