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.

A297318 Number of 5Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.

Original entry on oeis.org

1, 200, 3159, 29212, 484808, 8273245, 121339476, 1815438259, 27950049482, 426949482189, 6494779570376, 98961790075322, 1508712969034695, 22994788538451691, 350445360895775177, 5341072484013959839
Offset: 1

Views

Author

R. H. Hardin, Dec 28 2017

Keywords

Comments

Row 5 of A297314.

Examples

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

Crossrefs

Cf. A297314.