login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206684 Number of (n+1) X 8 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases. 1

%I

%S 422016,10300608,373903296,11019153780,401233408020,11814420790656,

%T 430502655386142,12617309045283948,458475690005909256,

%U 13442826543270192528,488345209526432269122,14319618461612628650220

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

%C Column 7 of A206685.

%H R. H. Hardin, <a href="/A206684/b206684.txt">Table of n, a(n) for n = 1..19</a>

%e Some solutions for n=4:

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

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

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 20:23 EDT 2020. Contains 337291 sequences. (Running on oeis4.)