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.

A296950 Number of nX6 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1s.

Original entry on oeis.org

9, 256, 1765, 17450, 256713, 2640993, 29067775, 356242817, 4007327435, 45579824373, 533089787086, 6110543663491, 70142323962609, 810920084478849, 9331277910756214, 107381182592973180, 1237942191372084761
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2017

Keywords

Comments

Column 6 of A296952.

Examples

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

Crossrefs

Cf. A296952.