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

%I

%S 256,37408,22773384,51169273632,507960770486000

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

%C Diagonal of A207799.

%e Some solutions for n=3:

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 20 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 August 17 08:02 EDT 2022. Contains 356184 sequences. (Running on oeis4.)