The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206744 Number of (n+1) X (n+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases. 0
 256, 36384, 43894936, 343128343904, 16261882009570952, 4664832957577714246616 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A206752. LINKS EXAMPLE Some solutions for n=4: ..0..0..0..0..1....2..2..3..0..3....0..0..3..0..0....1..0..0..0..0 ..0..1..0..3..0....3..2..2..3..0....1..1..0..3..3....3..1..0..1..0 ..2..3..1..0..0....1..3..2..3..3....3..3..1..0..3....1..3..1..3..1 ..2..2..3..2..0....1..3..3..3..0....1..1..3..1..0....1..1..3..0..2 ..0..0..1..3..2....3..2..2..2..3....0..1..1..2..1....0..0..1..2..0 CROSSREFS Sequence in context: A206101 A221091 A205458 * A207791 A018798 A017320 Adjacent sequences: A206741 A206742 A206743 * A206745 A206746 A206747 KEYWORD nonn AUTHOR R. H. Hardin, Feb 12 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 16:14 EST 2023. Contains 359833 sequences. (Running on oeis4.)