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!)
A206677 Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases. 0

%I #7 Dec 13 2015 21:19:18

%S 81,1728,89022,7423464,1533200232,514286765952,430502655386142,

%T 585855616489964136,1994442621051565402650

%N Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.

%C Diagonal of A206685.

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 11 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 20 06:53 EDT 2024. Contains 371799 sequences. (Running on oeis4.)