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.

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

Original entry on oeis.org

2, 8, 98, 1265, 17356, 241583, 3395532, 48048796, 683306658, 9759462283, 139866408792, 2010279482902, 28963821801648, 418182844095108, 6048773850787538, 87632133398349504, 1271377018275506438
Offset: 1

Views

Author

R. H. Hardin Mar 12 2013

Keywords

Comments

Row 2 of A223041

Examples

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