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.

A298964 Number of n X n 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

1, 8, 219, 21098, 6892031, 7785598672, 30241030285680, 403845370764198967, 18541589058526001745929
Offset: 1

Views

Author

R. H. Hardin, Jan 30 2018

Keywords

Comments

Diagonal of A298970.

Examples

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

Crossrefs

Cf. A298970.