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

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

%S 44948,5719838,706149734,89046135210,11197401806412,1410846309824300,

%T 177700386195973368,22387171143190946674,2820279543005322791600,

%U 355303174688921476145954,44761475493150370182553502

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

%C Column 4 of A209787

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

%e Some solutions for n=4

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

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

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

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

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 11:52 EDT 2024. Contains 375353 sequences. (Running on oeis4.)