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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205665 Number of 8X(n+1) 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors. 1

%I

%S 92062852,162377816,939384668,26605030292,1092079388028,

%T 54588666013136,2904705131186012,166238466407276348,

%U 9834684014476639808,601829146506334737576,37463980727959096279020,2369158930358310919375076

%N Number of 8X(n+1) 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.

%C Row 7 of A205659.

%H R. H. Hardin, <a href="/A205665/b205665.txt">Table of n, a(n) for n = 1..21</a>

%e Some solutions for n=4:

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

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

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 30 2012

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 July 2 01:52 EDT 2022. Contains 354984 sequences. (Running on oeis4.)