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!)
A205652 Number of (n+1)X(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. 0

%I #7 Oct 09 2015 04:25:14

%S 256,12296,511632,41013960,7578064080,2994560119488,2904705131186012

%N Number of (n+1)X(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 Diagonal of A205659.

%e Some solutions for n=4:

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

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

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

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

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 29 23:21 EST 2024. Contains 370428 sequences. (Running on oeis4.)