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

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

%S 64,12492,13606964,89046135210,3413352967754696,774627496109684203370,

%T 1034141529418861531701953000,8145663030420623706384712975053986

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

%C Diagonal of A209787

%e Some solutions for n=4

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

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

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

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

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

%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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)