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

%I

%S 6049,490547,35741496,2708892873,203828058161,15380031974285,

%T 1159953545419801,87501032165288030,6600426667881339226,

%U 497894721865502792367,37557974910650911070499,2833135360759134027255304

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

%C Column 7 of A209553

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 10 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 24 04:47 EST 2022. Contains 350534 sequences. (Running on oeis4.)