login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206115 Number of (n+1) X 6 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases. 1

%I

%S 171564,588840,2408480,21702240,190349280,1990281312,18371031840,

%T 163028308320,1709651647008,15780716350560,140041316846880,

%U 1468590764779872,13555635345131040,120295491171469920

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

%C Column 5 of A206118.

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

%F Empirical: a(n) = 859*a(n-3) for n>8.

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 03 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 November 27 04:53 EST 2021. Contains 349346 sequences. (Running on oeis4.)