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!)
A206113 Number of (n+1) X 4 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 6028,22624,88596,520800,2408480,10792800,59892000,276975200,

%T 1241172000,6887580000,31852148000,142734780000,792071700000,

%U 3662997020000,16414499700000,91088245500000,421244657300000,1887667465500000

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

%C Column 3 of A206118.

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

%F Empirical: a(n) = 115*a(n-3) for n>6.

%e Some solutions for n=4:

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

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

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

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

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

%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 February 28 01:50 EST 2020. Contains 332319 sequences. (Running on oeis4.)