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

%I

%S 1344,16892,282996,4796092,81302880,1377662868,23340152044,

%T 395403752128,6698395782004,113474612575628,1922321318016168,

%U 32565148864444732,551670927155642340,9345598309321513584,158319393789428735572

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

%C Column 2 of A206327

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

%F Empirical: a(n) = 24*a(n-1) -131*a(n-2) +200*a(n-3) -116*a(n-4) +35*a(n-5) -13*a(n-6) +2*a(n-7) for n>10

%e Some solutions for n=4

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

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

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

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

%e ..2..1..3....3..1..0....2..1..0....3..0..3....0..3..1....0..2..1....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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 11:16 EST 2022. Contains 350465 sequences. (Running on oeis4.)