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.

A282790 Number of nX7 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element.

Original entry on oeis.org

26, 736, 38027, 832218, 22998587, 545174028, 12713143876, 292288389872, 6555156469894, 145619095090322, 3197415688277735, 69595512931794512, 1504085477252415247, 32301337050939080872, 690041423059410095352
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2017

Keywords

Comments

Column 7 of A282791.

Examples

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

Crossrefs

Cf. A282791.