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.

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

Original entry on oeis.org

34, 353, 3755, 44951, 508111, 5834429, 67007971, 768117235, 8815633972, 101151930988, 1160784250565, 13320805118343, 152872860190807, 1754476739053004, 20135403174093836, 231092540344213255
Offset: 1

Views

Author

R. H. Hardin, Dec 21 2017

Keywords

Comments

Column 7 of A296834.

Examples

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

Crossrefs

Cf. A296834.