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.

A296127 Number of nX7 0..1 arrays with each 1 adjacent to 2 or 5 king-move neighboring 1s.

Original entry on oeis.org

1, 121, 553, 2463, 35733, 263489, 1810441, 16855693, 138016847, 1087543621, 9228070694, 76704166206, 628908321069, 5245176224753, 43644001864720, 361707709471024, 3008980635521615, 25033019588307299, 208047564104356544
Offset: 1

Views

Author

R. H. Hardin, Dec 05 2017

Keywords

Comments

Column 7 of A296128.

Examples

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

Crossrefs

Cf. A296128.