The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A206021. LINKS 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 Adjacent sequences:  A206010 A206011 A206012 * A206014 A206015 A206016 KEYWORD nonn AUTHOR R. H. Hardin, Feb 02 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 25 08:21 EST 2020. Contains 332221 sequences. (Running on oeis4.)