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.

A297760 Number of n X 6 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1's.

Original entry on oeis.org

1, 225, 4088, 73352, 2263784, 59707529, 1504842706, 39769163381, 1043883771677, 27215281320793, 712187211744833, 18637857993221677, 487388094274625336, 12748605716033435676, 333484777432792798647, 8722865447789945824645
Offset: 1

Views

Author

R. H. Hardin, Jan 05 2018

Keywords

Comments

Column 6 of A297762.

Examples

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

Crossrefs

Cf. A297762.