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!)
A210388 Number of (n+1)X7 0..2 arrays with every 2X2 subblock having one, two or three distinct clockwise edge differences 1

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

%S 2668077,3398046223,4327063104645,5512336193872815,

%T 7022635194726704581,8946828669222001072923,

%U 11398269977304081985788081,14521414001971479753332954339,18500305591567510345480379056213

%N Number of (n+1)X7 0..2 arrays with every 2X2 subblock having one, two or three distinct clockwise edge differences

%C Column 6 of A210390

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 20 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 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)