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

%I #6 Mar 31 2012 12:37:09

%S 81,1980,27060,419088,9653376,338009472,19410499584,1690931386368,

%T 230418338273280,52219993101631488,18073632573916545024,

%U 9818099537300641382400,8885510832166696098201600

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

%C Diagonal of A205986

%H R. H. Hardin, <a href="/A205978/b205978.txt">Table of n, a(n) for n = 1..17</a>

%e Some solutions for n=4

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

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

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

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

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

%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 April 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)