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!)
A205922 Number of (n+1)X5 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero 1

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

%S 9144,104311,583542,7177505,40724536,535691452,3047588270,42247423238,

%T 240169745414,3447138724818,19567338424076,286774605083392,

%U 1625846521511432,24111794299224170,136592525133890114

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

%C Column 4 of A205926

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 01 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 24 05:33 EDT 2024. Contains 371918 sequences. (Running on oeis4.)