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.

A297295 Number of n X n 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1's.

Original entry on oeis.org

1, 1, 3, 10, 49, 495, 13504, 629563, 40753529, 4162842319, 790491998237, 268041967942170, 155466640607601204, 159960976273554094907, 300474954115694463716874, 1003924486221768324971576564
Offset: 1

Views

Author

R. H. Hardin, Dec 27 2017

Keywords

Comments

Diagonal of A297299.

Examples

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

Crossrefs

Cf. A297299.