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

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

%S 112,78628,688122928,75244563204398,102755730987812117952,

%T 1752648993312488853687634462,373366766716480043025684339650029800,

%U 993411552731407131616878668696108769698390398

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

%C Diagonal of A210300

%e Some solutions for n=4

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

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

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

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

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)