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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206201 Number of (n+1)X4 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases 1

%I #5 Mar 31 2012 12:37:10

%S 1768,3008,5136,11832,27400,60800,145208,346080,775944,1799656,

%T 4265112,9666256,22287416,52569856,120132224,276283624,648644008,

%U 1490750392,3426149328,8010922248,18480112640,42488361472,99015558792,228939593928

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

%C Column 3 of A206206

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

%F Empirical: a(n) = 10*a(n-3) +5*a(n-4) +a(n-5) +2*a(n-8) +2*a(n-10) for n>18

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 04 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 April 21 03:36 EDT 2024. Contains 371850 sequences. (Running on oeis4.)