login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

Table of n, a(n) for n=1..6.

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 08:49 EST 2016. Contains 279049 sequences.