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.

A183479 Number of nX5 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

13, 495, 2925, 40073, 706473, 7773025, 107741253, 1577932971, 20728674493, 287526589977, 4036331530635, 55313628172919, 767230355186961, 10669808831015745, 147604547979187367, 2047336009619708185
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 5 of A183483

Examples

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