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.

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

Original entry on oeis.org

16, 512, 11303, 280642, 6896530, 170243005, 4203272237, 103785926879, 2562713574885, 63279709651014, 1562532732365521, 38582817153962988, 952705725385867657, 23524674373682096884, 580882734290938810868
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2018

Keywords

Comments

Column 5 of A299740.

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

Crossrefs

Cf. A299740.

Formula

Empirical recurrence of order 79 (see link above)