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.

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

Original entry on oeis.org

1, 14, 533, 2936, 23781, 320168, 4340367, 46828204, 531988739, 6428177030, 77067241642, 902041302792, 10619747871090, 125974447710657, 1491769553672883, 17617404647236968, 208221597373256228
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2018

Keywords

Comments

Row 5 of A297802.

Examples

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

Crossrefs

Cf. A297802.