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.

A222839 Number of n X 2 0..3 arrays with no more than n 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

1, 8, 105, 1585, 23107, 353631, 5338646, 81874696, 1252153841, 19270376854, 296641979113, 4580055753005, 70780702170260, 1095722113681548, 16978656325074532, 263390892198118920, 4089414898741050209, 63545865459514492673, 988136631583140164460, 15375690197520184535506
Offset: 1

Views

Author

R. H. Hardin, Mar 06 2013

Keywords

Examples

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

Crossrefs

Column 2 of A222842.