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!)
A205641 Number of (n+1)X8 0..3 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors. 0

%I #6 Oct 09 2015 04:26:03

%S 158804736,13444055224,4782966551464,3046981775525932,

%T 2083971490096234516,1438784646024287898832,995980221935339574016820,

%U 690272631599920646789218256

%N Number of (n+1)X8 0..3 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.

%C Column 7 of A205642.

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 29 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 March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)