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.

A222653 Number of nX4 0..3 arrays with no more than floor(nX4/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

11, 724, 61757, 5024944, 411489189, 33625853402, 2757290901238, 226934394962954, 18748702054088170, 1554468757231979806, 129297779576953689571, 10785833060389951147809, 902060948747063990782774
Offset: 1

Views

Author

R. H. Hardin Feb 27 2013

Keywords

Comments

Column 4 of A222654

Examples

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