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

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

%S 4596072,1966171084,848327900384,365468694266436,157233431036489148,

%T 67595116900832029672,29048689240586916141284,

%U 12481384538302527859923440,5362463708438175275453119020,2303828616153300698234374000660

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

%C Column 6 of A206197

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 04 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 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)