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.

A183475 Number of n X n 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.

Original entry on oeis.org

1, 15, 117, 4015, 706473, 116198719, 84056287173
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Diagonal of A183483

Examples

			Some solutions for 4X4
..0..1..1..0....0..0..0..0....2..0..1..0....2..1..2..1....0..0..2..2
..0..0..0..0....1..0..0..0....2..0..1..0....2..0..1..1....2..0..0..0
..2..0..1..2....1..0..0..1....0..0..0..0....0..0..0..0....2..0..0..0
..2..0..1..2....0..0..0..1....1..1..0..0....0..2..2..0....0..0..0..0