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.

A295775 Number of n X n 0..1 arrays with each 1 adjacent to 0 or 2 king-move neighboring 1's.

Original entry on oeis.org

2, 9, 56, 1059, 37897, 2602065, 409525082, 128171125105, 83333126432833, 114403160523019326, 323325261181740261922, 1905368274130445991781276
Offset: 1

Views

Author

R. H. Hardin, Nov 27 2017

Keywords

Comments

Diagonal of A295781.

Examples

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

Crossrefs

Cf. A295781.