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.

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

16, 512, 11283, 280468, 6892031, 170137416, 4200575252, 103715870545, 2560893666570, 63232497527110, 1561310446894473, 38551239404752239, 951891497499265483, 23503717252026765272, 580344217887313443874
Offset: 1

Views

Author

R. H. Hardin, Jan 30 2018

Keywords

Comments

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

Crossrefs

Cf. A298970.

Formula

Empirical recurrence of order 75 (see link above).