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.

A199126 Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.

Original entry on oeis.org

1, 1, 1, 3, 6, 5, 19, 37, 29, 124, 240, 182, 834, 1614, 1198, 5746, 11137, 8142, 40336, 78332, 56620, 287358, 559134, 400598, 2071558, 4038130, 2872754, 15079270, 29443040, 20824778, 110653854, 216379650, 152303410, 817542980, 1600817660
Offset: 1

Views

Author

R. H. Hardin Nov 03 2011

Keywords

Comments

Column 1 of A199133

Examples

			All solutions for n=5
..0....0....0....0....0....0
..1....1....1....1....1....1
..2....2....2....0....2....0
..0....1....0....2....1....1
..2....2....1....1....0....2
		

Formula

Conjecture: a(3n) = A190917(n). - R. J. Mathar, Nov 01 2015