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!)
A206750 Number of (n+1) X 7 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 #6 Dec 13 2015 21:28:59

%S 12105120,9604042208,7932406245672,6623662914493232,

%T 5553852508380267184,4664832957577714246616,3920972890172486310882016,

%U 3296755941481489235686937392

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

%C Column 6 of A206752.

%e Some solutions for n=4:

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

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

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

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

%e ..3..1..2..0..3..1..0....0..0..1..3..0..2..0....1..1..0..2..2..3..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 April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)