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!)
A210334 1/4 the number of (n+1)X8 0..3 arrays with every 2X2 subblock having two or three distinct clockwise edge differences 1

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

%S 48410727,249408131339,1221987668386411,6132398417786621509,

%T 30671441607393794461769,153622523285419300031038131,

%U 769246866811235591580558612197,3852295230912472939741564317198993

%N 1/4 the number of (n+1)X8 0..3 arrays with every 2X2 subblock having two or three distinct clockwise edge differences

%C Column 7 of A210335

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

%e Some solutions for n=4

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

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

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

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

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

%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:57 EDT 2024. Contains 371905 sequences. (Running on oeis4.)