The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238077 Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I

%S 59772,1191324,19616408,336372000,6222330452,119781203860,

%T 2220366275092,40590407292556,760523734925120,14540553425940596,

%U 270610531881145908,4981197409959203592,93358956752609946032,1773802591748381975996

%N Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 4 of A238081

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 31 20:23 EDT 2020. Contains 334748 sequences. (Running on oeis4.)