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

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

%I #10 Jun 17 2018 08:14:15

%S 306,1728,9792,55836,317736,1809324,10300608,58646916,333899064,

%T 1901032092,10823363424,61621963812,350839639224,1997477224380,

%U 11372475138624,64748269110564,368639041055544,2098816612656732

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

%C Column 2 of A206685.

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

%F Empirical: a(n) = 3*a(n-1) + 13*a(n-2) + 11*a(n-3) + 12*a(n-4) + 6*a(n-5) for n>6.

%F Empirical g.f.: 18*x*(17 + 45*x + 35*x^2 + 35*x^3 + 14*x^4 - 2*x^5) / (1 - 3*x - 13*x^2 - 11*x^3 - 12*x^4 - 6*x^5). - _Colin Barker_, Jun 17 2018

%e Some solutions for n=4:

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

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

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

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

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

%Y Cf. A206685.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 11 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 22 20:25 EDT 2024. Contains 373608 sequences. (Running on oeis4.)