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

%I #5 Dec 04 2014 17:06:56

%S 1370,29476,634130,13645310,293605794,6317788810,135943372394,

%T 2925210367882,62943768374994,1354414020937618,29143904618268426,

%U 627113753199624042,13494065168624545378,290363042729285779778

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

%C Column 1 of A251567

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

%F Empirical: a(n) = 2*a(n-1) +683*a(n-2) -1190*a(n-3) -118654*a(n-4) +194244*a(n-5) +6910296*a(n-6) -10802232*a(n-7) -90489056*a(n-8) +131731584*a(n-9) +397649376*a(n-10) -495556416*a(n-11) -655135488*a(n-12) +561254400*a(n-13) +325140480*a(n-14)

%e Some solutions for n=2

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

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

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

%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 16 01:01 EDT 2024. Contains 371696 sequences. (Running on oeis4.)