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

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

%I

%S 423,5199,69585,953865,13148043,181467207,2505335985,34591087977,

%T 477605748651,6594418668279,91050821905233,1257162198849945,

%U 17357963791492635,239665900404460215,3309129149913889857

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

%C Column 2 of A206414.

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

%F Empirical: a(n) = 19*a(n-1) - 78*a(n-2) + 86*a(n-3) + 17*a(n-4) - 41*a(n-5) + 10*a(n-6).

%F Empirical g.f.: 3*x*(141 - 946*x + 1266*x^2 + 298*x^3 - 689*x^4 + 170*x^5) / ((1 - 3*x - x^2 + x^3)*(1 - 16*x + 31*x^2 - 10*x^3)). - _Colin Barker_, Jun 16 2018

%e Some solutions for n=4:

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

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

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

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

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

%Y Cf. A206414.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 07 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.

Last modified January 24 17:16 EST 2022. Contains 350565 sequences. (Running on oeis4.)