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.

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

Original entry on oeis.org

1, 8, 247, 29408, 13431706, 23582064542, 159047224409362, 4121184916626976747, 410254820466598294243538, 156900221075811012583120150328, 230531929217067955283511588326278811
Offset: 1

Views

Author

R. H. Hardin, Feb 15 2018

Keywords

Comments

Diagonal of A299654.

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..0..1..0..1. .0..0..0..1..0. .0..0..1..0..1. .0..0..1..1..0
..1..0..0..1..0. .0..1..1..0..0. .1..0..1..1..0. .0..0..1..0..0
..1..0..0..1..0. .0..1..1..0..1. .0..0..1..0..1. .1..1..0..0..0
..0..0..1..1..0. .1..0..0..0..1. .1..0..0..1..1. .0..0..1..1..0
		

Crossrefs

Cf. A299654.