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.

A297548 Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.

Original entry on oeis.org

1, 14, 461, 2205, 12161, 205888, 2748026, 25141813, 257022624, 3107723264, 35428053457, 379567391600, 4182220329864, 47242475898249, 526748427926749, 5818430376752828, 64655311668945484, 721026932221046595
Offset: 1

Views

Author

R. H. Hardin, Dec 31 2017

Keywords

Comments

Row 5 of A297544.

Examples

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

Crossrefs

Cf. A297544.