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

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

%I

%S 81,306,1276,4672,18784,70688,278352,1062192,4143280,15915216,

%T 61792048,238127760,922461744,3560485008,13777495472,53218656784,

%U 205822482224,795331807888,3075135853232,11884984533264,45947260928560

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

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

%F Empirical: a(n) = 9*a(n-2) + 14*a(n-3) + 30*a(n-4) + 16*a(n-5) + 8*a(n-6) for n>7.

%F Empirical g.f.: x*(81 + 306*x + 547*x^2 + 784*x^3 + 586*x^4 + 300*x^5 + 64*x^6) / (1 - 9*x^2 - 14*x^3 - 30*x^4 - 16*x^5 - 8*x^6). - _Colin Barker_, Oct 20 2018

%e Some solutions for n=5:

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

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

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

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

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

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

%Y Column 1 of A236018.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 18 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 August 17 02:42 EDT 2022. Contains 356180 sequences. (Running on oeis4.)