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

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

%S 3223192,2118517533,1308905451923,830023337140244,522757733883587522,

%T 330369121707817687620,208427296314737259382008,

%U 131618147804621095447618893,83072099151587827914461601665

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

%C Column 7 of A209716

%H R. H. Hardin, <a href="/A209715/b209715.txt">Table of n, a(n) for n = 1..178</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 11 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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)