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.

A240516 Number of n X 5 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.

Original entry on oeis.org

8, 21, 73, 326, 1376, 6205, 28942, 135093, 636475, 3024792, 14429369, 69010353, 330906118, 1589431389, 7642628408, 36779710534, 177110221193, 853219818189, 4111568990816, 19817506062480, 95533854083563, 460587995304966
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2014

Keywords

Comments

Column 5 of A240519.

Examples

			Some solutions for n=4
..0..1..1..0..1....0..1..1..1..0....0..0..0..1..0....0..1..0..1..0
..1..0..0..0..0....1..0..1..0..0....1..0..1..0..1....1..1..1..0..1
..0..1..0..1..1....0..1..0..1..0....0..1..0..0..0....0..1..0..1..1
..1..0..1..0..0....1..0..1..1..1....1..1..1..0..1....1..0..1..0..1
		

Crossrefs

Cf. A240519.