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.

A297543 Number of nX7 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.

Original entry on oeis.org

1, 381, 4617, 65363, 2748026, 67372651, 1610981344, 45496070039, 1204223924807, 31395434922611, 839621841413395, 22297914534222936, 589873752024831225, 15663501392099069812, 415682851416335706284, 11022783242886075047889
Offset: 1

Views

Author

R. H. Hardin, Dec 31 2017

Keywords

Comments

Column 7 of A297544.

Examples

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

Crossrefs

Cf. A297544.