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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236495 Number of (n+1)X(1+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock 1

%I #5 Jan 27 2014 04:49:11

%S 256,2228,19856,171436,1503360,13078180,114229184,995583500,

%T 8688160944,75762394644,660932725968,5764551429420,50283755683392,

%U 438589701233540,3825664710332480,33369191924137804,291064911609837232

%N Number of (n+1)X(1+1) 0..3 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock

%C Column 1 of A236500

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

%F Empirical: a(n) = 32*a(n-2) +208*a(n-3) +1222*a(n-4) +2448*a(n-5) +2716*a(n-6) +944*a(n-7) -681*a(n-8) -1944*a(n-9) -1248*a(n-10) -512*a(n-11) for n>12

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 27 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 April 13 05:19 EDT 2024. Contains 371639 sequences. (Running on oeis4.)