login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A206013
Number of (n+1) X (n+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.
0
104, 7688, 1763560, 1312173688, 3222294559864, 26463715503890184, 732416961112609324840, 68720985559450744063171672
OFFSET
1,1
COMMENTS
Diagonal of A206021.
EXAMPLE
Some solutions for n=3:
..2..2..3..0....3..1..3..1....1..1..3..2....3..0..1..0....1..1..3..3
..3..0..3..1....0..0..3..0....0..2..3..0....1..0..2..2....3..2..2..0
..3..1..2..1....2..1..3..2....1..1..3..2....1..3..3..0....3..0..1..1
..0..1..0..1....2..0..3..0....2..0..0..1....0..0..2..1....1..0..2..3
CROSSREFS
Sequence in context: A004393 A286329 A164759 * A187700 A015272 A048920
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 02 2012
STATUS
approved