cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A205816 Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.

Original entry on oeis.org

24, 216, 2880, 67944, 2791080, 206195280, 27196042704, 6437088838008, 2723887997403024, 2064821553536444652, 2798458452635665138464
Offset: 1

Views

Author

R. H. Hardin, Feb 01 2012

Keywords

Comments

Diagonal of A205823.

Examples

			Some solutions for n=4:
..2..2..1..0..0....1..2..0..2..2....0..1..0..2..2....2..0..2..2..1
..1..0..1..2..1....0..2..1..1..0....2..2..0..1..0....2..1..1..0..0
..1..2..1..0..0....1..2..0..2..2....0..1..0..2..2....2..0..2..2..1
..1..0..1..2..1....0..2..1..1..0....2..2..0..1..0....1..1..1..0..0
..1..2..1..0..0....1..2..0..2..2....0..1..0..2..0....2..0..2..2..1