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

%I

%S 7388,9464,11832,32920,70168,109720,337896,728704,1137208,3418192,

%T 7313872,11389472,34215016,73207664,114003240,342487240,732805056,

%U 1141169536,3428290592,7335364432,11423084832,34317120936,73426851984

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

%C Column 4 of A206206

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

%F Empirical: a(n) = 10*a(n-3) +a(n-9) for n>18

%e Some solutions for n=4

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

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

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 18:40 EDT 2021. Contains 348033 sequences. (Running on oeis4.)