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.

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

Original entry on oeis.org

2, 105, 4797, 326408, 15364848, 1077545438, 52487425596, 3689615795056, 182579365380505, 12856303224433084, 643621625467714042, 45333053732314073754, 2288743268254953421250, 161184278096856509113288
Offset: 1

Views

Author

R. H. Hardin Mar 06 2013

Keywords

Comments

Column 3 of A222842

Examples

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