login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 872455004,24016699289368,658686645074030420,18074362569780907584746,

%T 495927352523356139887864420,13607462253433812638431489199962,

%U 373366766716480043025684339650029800

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

%C Column 7 of A210300

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 19 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 27 05:24 EDT 2020. Contains 334649 sequences. (Running on oeis4.)