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.

A282646 Number of nX7 0..1 arrays with no 1 equal to more than one of its king-move neighbors.

Original entry on oeis.org

81, 1444, 25153, 557439, 10614316, 213392087, 4257307148, 84514081303, 1685475197497, 33544066527869, 667927323468328, 13300345031547682, 264815719570028929, 5272968794893979347, 104992034881743428678
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2017

Keywords

Comments

Column 7 of A282647.

Examples

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

Crossrefs

Cf. A282647.

Formula

Empirical recurrence of order 66 (see link above)