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.

A301614 Number of nX7 0..1 arrays with every element equal to 1, 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 1172, 72758, 4422826, 271301458, 16632517333, 1019565752074, 62500458737127, 3831336753439723, 234864521959895889, 14397413152054371201, 882574864133207632568, 54102660842288578973363, 3316543531108585833444946
Offset: 1

Views

Author

R. H. Hardin, Mar 24 2018

Keywords

Comments

Column 7 of A301615.

Examples

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

Crossrefs

Cf. A301615.