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.

A296321 Number of n X n 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.

Original entry on oeis.org

1, 3, 11, 61, 853, 20088, 850404, 72224019, 11207386103, 3245575984755, 1784744625714267, 1830394475306895557, 3517200566091635085954, 12698075318404649075573041, 85871949097296276009847589332
Offset: 1

Views

Author

R. H. Hardin, Dec 10 2017

Keywords

Comments

Diagonal of A296327.

Examples

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

Crossrefs

Cf. A296327.