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

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

%S 55864,2567488,101839532,3974151636,153755370824,5940013254736,

%T 229359164378264,8855443936590808,341897525465661668,

%U 13200258981410196584,509647127610240024140,19676927182424276758028

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

%C Column 4 of A206085

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 03 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 March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)