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!)
A209910 Half the number of (n+1)X6 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences 1

%I

%S 399930,152153160,53888573444,19391662870652,6954596004028468,

%T 2497054784947973388,896278100477366851795,321743305461455008300382,

%U 115494087693753318505527463,41458747023669964452852387044

%N Half the number of (n+1)X6 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences

%C Column 5 of A209913

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 15 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 June 27 04:16 EDT 2022. Contains 354888 sequences. (Running on oeis4.)