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.

A194499 Number of lower triangles of an n X n 0..2 array with each element unequal to the sum mod 3 of its horizontal and vertical neighbors.

Original entry on oeis.org

2, 8, 72, 1020, 32768, 2097152, 268460064, 68721573888, 35184372088832, 36028797020012544
Offset: 1

Views

Author

R. H. Hardin Aug 27 2011

Keywords

Comments

Column 2 of A194505

Examples

			Some solutions for 3X3
..1......1......2......0......0......0......0......2......0......1......1
..0.0....2.0....0.0....2.0....2.1....2.2....2.2....1.2....2.0....0.2....2.1
..1.2.0..2.2.1..0.1.2..0.2.0..2.1.0..1.1.0..1.1.2..1.2.0..0.2.1..2.1.2..1.1.0