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!)
A251330 Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to 2 4 or 6 1

%I #4 Dec 01 2014 19:16:12

%S 753,7393,75391,801579,8863633,101497397,1196729319,14442382927,

%T 177420001949,2208479081653,27755064033131,351209824628763,

%U 4465808638298741,56979652386854697,728758207069222935

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

%C Column 3 of A251335

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

%F Empirical: a(n) = 49*a(n-1) -940*a(n-2) +8509*a(n-3) -30084*a(n-4) -47347*a(n-5) +500152*a(n-6) +81043*a(n-7) -3272883*a(n-8) -3063686*a(n-9) +3924236*a(n-10) +5794584*a(n-11) +519392*a(n-12) -1443456*a(n-13) -207360*a(n-14) +110592*a(n-15)

%e Some solutions for n=3

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

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

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

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 16:15 EDT 2024. Contains 374650 sequences. (Running on oeis4.)