The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206325 Number of (n+1)X7 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases 1

%I

%S 5432884,1377662868,507368863264,192331317667804,73493501930345884,

%T 28153923918860656368,10794194502778261468304,

%U 4139628382451870628262520,1587705875694898193873275576,608959968033447679700747202336

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

%C Column 6 of A206327

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

%e Some solutions for n=4

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

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

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

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

%e ..0..2..0..2..0..2..1....2..0..1..3..2..0..3....3..2..1..0..3..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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 14:20 EST 2022. Contains 350598 sequences. (Running on oeis4.)