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!)
A210297 Half the number of (n+1)X6 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1

%I

%S 4402192,9694276684,21290108702694,46773822117508382,

%T 102755730987812117952,225741948376039857049980,

%U 495927352523356139887864420,1089491673865425887607249889930

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

%C Column 5 of A210300

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

%e Some solutions for n=4

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

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

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

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

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

%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 January 28 11:48 EST 2022. Contains 350655 sequences. (Running on oeis4.)