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!)
A206147 Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases. 1

%I

%S 1458,23346,379602,6204438,101596896,1664748270,27284864220,

%T 447232269654,7330916855718,120167900345196,1969792468989480,

%U 32288891319485190,529280670290557896,8675989562774602188,142217172462541690296

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

%C Column 5 of A206150.

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

%F Empirical: a(n) = 30*a(n-1) - 291*a(n-2) + 1278*a(n-3) - 2901*a(n-4) + 3519*a(n-5) - 2152*a(n-6) + 516*a(n-7).

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 04 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 02:30 EST 2022. Contains 350464 sequences. (Running on oeis4.)