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.

A296326 Number of nX7 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.

Original entry on oeis.org

1, 45, 278, 1677, 14691, 112235, 850404, 6660799, 51754039, 401363520, 3119306759, 24239641260, 188341349284, 1463488096858, 11372085577974, 88367785063892, 686667612240495, 5335806199766372, 41462375276685856, 322187049424431729
Offset: 1

Views

Author

R. H. Hardin, Dec 10 2017

Keywords

Comments

Column 7 of A296327.

Examples

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

Crossrefs

Cf. A296327.