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.

A297542 Number of nX6 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.

Original entry on oeis.org

1, 105, 905, 10234, 205888, 3015179, 45293985, 726450667, 11267743659, 174940837668, 2737325839679, 42676467159309, 665276067132323, 10380615509680131, 161909949029518946, 2525266352244161021
Offset: 1

Views

Author

R. H. Hardin, Dec 31 2017

Keywords

Comments

Column 6 of A297544.

Examples

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

Crossrefs

Cf. A297544.