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

 

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

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

%S 41589,9582,5850,9144,13752,19200,35904,54528,77376,146304,223200,

%T 316032,590592,895104,1264512,2362368,3580416,5058048,9449472,

%U 14321664,20232192,37797888,57286656,80928768,151191552,229146624,323715072,604766208

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

%C Column 7 of A207050

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

%F Empirical: a(n) = 4*a(n-3) for n>15

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:34 EDT 2024. Contains 371971 sequences. (Running on oeis4.)