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!)
A209515 Number of (n+1) X 7 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases. 1

%I #9 Oct 06 2015 21:53:16

%S 598491,181445643,56515446141,17769569448759,5607670578249789,

%T 1772313933013227273,560493388203596285283,177302245070678360735145,

%U 56092636774113844825575603,17746700710940389030443863763

%N Number of (n+1) X 7 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.

%C Column 6 of A209517.

%H R. H. Hardin, <a href="/A209515/b209515.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Mar 09 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 July 17 17:29 EDT 2024. Contains 374377 sequences. (Running on oeis4.)