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

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

%S 194691,14037225,878480541,53518920690,3216834301377,192565971689028,

%T 11507134891499922,687199384304917248,41028637408654135623,

%U 2449346478806438582973,146216682169316734879641

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

%C Column 6 of A206054

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

%e Some solutions for n=4

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

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

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

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

%e ..2..0..1..1..2..2..2....1..1..1..2..2..2..2....1..0..1..2..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 August 19 10:34 EDT 2024. Contains 375284 sequences. (Running on oeis4.)