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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251375 Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock summing to 5 6 or 7 1

%I #4 Dec 01 2014 21:47:47

%S 1048,19644,385704,7712232,155378004,3140670344,63575161960,

%T 1287767101980,26092537560408,528754534404104,10715654829290772,

%U 217167872708553784,4401270254542866296,89199630453126585356

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

%C Column 2 of A251381

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

%F Empirical: a(n) = 33*a(n-1) -258*a(n-2) -425*a(n-3) +9681*a(n-4) -20982*a(n-5) -28396*a(n-6) +102584*a(n-7) -55200*a(n-8) -23420*a(n-9) +17424*a(n-10) -528*a(n-11) -576*a(n-12)

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 01 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 March 3 11:54 EST 2024. Contains 370511 sequences. (Running on oeis4.)