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.

A298969 Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

64, 8192, 581057, 49885231, 4200575252, 356356552103, 30241030285680, 2566506415636896, 217825152899921097, 18487503017529807194, 1569093086125030344062, 133174005805446365581185
Offset: 1

Views

Author

R. H. Hardin, Jan 30 2018

Keywords

Comments

Column 7 of A298970.

Examples

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

Crossrefs

Cf. A298970.