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

%I #7 Dec 12 2015 18:00:13

%S 600519,181467207,56515649709,17769571483479,5607670598448153,

%T 1772313933215113017,560493388205613135219,177302245070698531560585,

%U 56092636774114046549483283,17746700710940391048253081503

%N Number of (n+1) X 7 0..2 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 A206414.

%H R. H. Hardin, <a href="/A206412/b206412.txt">Table of n, a(n) for n = 1..44</a>

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 07 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 13 09:19 EDT 2024. Contains 375130 sequences. (Running on oeis4.)