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.

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

Original entry on oeis.org

64, 5135, 96004, 1984001, 41994750, 893462062, 18964765818, 402597400706, 8547940665506, 181527035285787, 3854821615967821, 81862339042940669, 1738453613332468089, 36918733850285685708, 784027054636001040433
Offset: 1

Views

Author

R. H. Hardin, Apr 04 2018

Keywords

Comments

Column 7 of A302265.

Examples

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

Crossrefs

Cf. A302265.