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.

A297851 Number of n X n 0..1 arrays with every element equal to 1, 2 or 4 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

0, 3, 15, 30, 45, 131, 181, 298, 430, 1022, 1429, 2164, 2135, 4620, 3680, 9110, 11981, 9540, 87199, 22330, 77938, 182912, 34081
Offset: 1

Views

Author

R. H. Hardin, Jan 07 2018

Keywords

Comments

Diagonal of A297858.

Examples

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

Crossrefs

Cf. A297858.