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

%I

%S 62,13098,16664508,135833193008,6954596004028468,

%T 2253166071062026531552,4605826850905941430535864352,

%U 59470527831535893681344131012059952

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

%C Diagonal of A209913

%e Some solutions for n=4

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

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

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

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

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

%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 25 10:04 EDT 2022. Contains 354844 sequences. (Running on oeis4.)