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.

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

Original entry on oeis.org

0, 3, 15, 30, 45, 171, 229, 417, 822, 1359, 1993, 5049, 3669, 7878, 33158, 16734, 37752, 734240, 160344, 389218, 50665319, 1735920, 6661033
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2018

Keywords

Comments

Diagonal of A298093.

Examples

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

Crossrefs

Cf. A298093.