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!)
A205816 Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. 0

%I #7 Dec 10 2015 02:10:09

%S 24,216,2880,67944,2791080,206195280,27196042704,6437088838008,

%T 2723887997403024,2064821553536444652,2798458452635665138464

%N Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.

%C Diagonal of A205823.

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 01 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 April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)