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.

A222374 Number of nX3 0..3 arrays with no more than floor(nX3/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 5, 9, 118, 498, 8111, 37107, 676485, 3140167, 58995438, 275054103, 5223616489, 24395423052, 466212749842, 2180168118272, 41855166855421, 195981171753608, 3775984650279490, 17703134058396750, 342076192235557748
Offset: 1

Views

Author

R. H. Hardin Feb 17 2013

Keywords

Comments

Column 3 of A222378

Examples

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