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

%I

%S 256,36384,43894936,343128343904,16261882009570952,

%T 4664832957577714246616

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

%C Diagonal of A206752.

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 12 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 October 7 06:14 EDT 2022. Contains 357270 sequences. (Running on oeis4.)