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.

A298927 Number of nX5 0..1 arrays with every element equal to 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

0, 11, 3, 23, 94, 255, 666, 2720, 8571, 30093, 106192, 369318, 1291934, 4552705, 15952349, 56078262, 197277132, 693611434, 2438933680, 8579643205, 30173988847, 106130105150, 373307026724, 1313049614295, 4618497134678, 16245278266932
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2018

Keywords

Comments

Column 5 of A298930.

Examples

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

Crossrefs

Cf. A298930.