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.

A223038 Number of nX3 0..3 arrays with no more than floor(nX3/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, 98, 3780, 255943, 10904199, 751990800, 33007705273, 2293741863398, 102466787449225, 7147587418650349, 323100169712798727, 22585791054054582654, 1029786157956416130280, 72077809347126994984977
Offset: 1

Views

Author

R. H. Hardin Mar 12 2013

Keywords

Comments

Column 3 of A223041

Examples

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