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!)
A206059 Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases 1

%I

%S 170688,1390488,11155584,111242648,1198231144,12877680064,

%T 144759802024,1569116858248,16924630879224,190329775107408,

%U 2063119504595544,22257017331799496,250239172110308400,2712629181092377160

%N Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases

%C Column 4 of A206063

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

%F Empirical: a(n) = 1307*a(n-3) +24*a(n-4) +677*a(n-5) +44*a(n-6) +256*a(n-7) for n>16

%e Some solutions for n=4

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

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

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

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

%e ..1..3..2..1..1....3..2..3..0..1....0..0..3..2..3....3..2..2..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 October 21 10:52 EDT 2021. Contains 348150 sequences. (Running on oeis4.)