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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206314 Number of (n+1)X5 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero 1

%I

%S 53463,4466450,375274347,31585648103,2656145209648,223458785606871,

%T 18792437854613234,1580709874695673480,132941278551460873763,

%U 11181607230811497171290,940424480197031998954820

%N Number of (n+1)X5 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero

%C Column 4 of A206318

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

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

Last modified January 24 00:05 EST 2022. Contains 350515 sequences. (Running on oeis4.)