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.

A297658 Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.

Original entry on oeis.org

1, 454, 9033, 113252, 2525244, 56630842, 1075678445, 21111073411, 431729675719, 8661860619988, 172481732429072, 3459368740976069, 69421866008508425, 1390069610625497582, 27843303573923481669, 558020746500279361494
Offset: 1

Views

Author

R. H. Hardin, Jan 02 2018

Keywords

Comments

Row 5 of A297654.

Examples

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

Crossrefs

Cf. A297654.