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.

A326100 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 29, 161, 929, 5383, 31236, 181227, 1051456, 6100399, 35393679, 205349281, 1191408438, 6912388772, 40104734047, 232682180647, 1349990181408, 7832458355125, 45442851903417, 263653210203742, 1529679858088141
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 3 of A326105.

Examples

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

Crossrefs

Cf. A326105.

Formula

Empirical: a(n) = 5*a(n-1) +5*a(n-2) -2*a(n-3) -3*a(n-6) -2*a(n-7) -a(n-8) -a(n-9)