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.

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

Original entry on oeis.org

13, 70, 402, 2441, 14379, 85500, 508111, 3017667, 17931240, 106532750, 632991179, 3760963266, 22346554371, 132779031876, 788937821061, 4687716596985, 27853628252239, 165500927720484, 983379261249186, 5843086041423489
Offset: 1

Views

Author

R. H. Hardin, Dec 21 2017

Keywords

Comments

Column 5 of A296834.

Examples

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

Crossrefs

Cf. A296834.