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.

A296945 Number of n X n 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1's.

Original entry on oeis.org

1, 8, 45, 620, 37179, 2640993, 482228052, 246430289779, 233010334725043, 513658708035556281
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2017

Keywords

Comments

Diagonal of A296952.

Examples

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

Crossrefs

Cf. A296952.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.