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.

A296949 Number of nX5 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1s.

Original entry on oeis.org

6, 112, 544, 3637, 37179, 256713, 1898178, 16087936, 121741279, 933686077, 7473862911, 57912910897, 449682762989, 3538407928642, 27585262869841, 215073549972468, 1683740352779281, 13146690679835447, 102637633797615262
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2017

Keywords

Comments

Column 5 of A296952.

Examples

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

Crossrefs

Cf. A296952.