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!)
A206324 Number of (n+1)X6 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases 1

%I #5 Mar 31 2012 12:37:11

%S 673124,81302880,13817572060,2402295361876,419904864999804,

%T 73493501930345884,12867047450502167660,2252845520588162061604,

%U 394440987179669083025340,69060121294917710202087484

%N Number of (n+1)X6 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases

%C Column 5 of A206327

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 06 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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)