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.

A205759 Number of 8X(n+1) 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.

Original entry on oeis.org

383440, 3602578, 29561841, 341919297, 3496020388, 45262306396, 528507252157, 7409837678586, 95546688005488, 1427488689168257
Offset: 1

Views

Author

R. H. Hardin Jan 30 2012

Keywords

Comments

Row 7 of A205753

Examples

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