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

%I

%S 11568,33504,103998,419088,1814784,7793856,35107968,152423040,

%T 654688608,2949069312,12803535360,54993843072,247721822208,

%U 1075496970240,4619482818048,20808633065472,90341745500160,388036556716032

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

%C Column 4 of A205986

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

%F Empirical: a(n) = 84*a(n-3) for n>9

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 02 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 July 3 06:54 EDT 2022. Contains 355031 sequences. (Running on oeis4.)