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.

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

Original entry on oeis.org

57, 4995, 2071311, 4099186545, 38883961392081, 1772313933013227273, 388756746462464273412765, 410796134340987241848792211659, 2092643007412378548345728130194640495
Offset: 1

Views

Author

R. H. Hardin, Mar 09 2012

Keywords

Comments

Diagonal of A209517.

Examples

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