login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209795 Half the number of (n+1)X8 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference 1

%I

%S 2902980,2819342124,2710658447034,2613436161921981,

%T 2518750352620857312,2427793108137633168210,2340066952652845862645106,

%U 2255530912287027117930612162,2174043398490162505254364682718

%N Half the number of (n+1)X8 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference

%C Column 7 of A209796

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 13 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 May 25 16:08 EDT 2019. Contains 323572 sequences. (Running on oeis4.)