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.

A295917 Number of n X 7 0..1 arrays with each 1 adjacent to 0 or 3 king-move neighboring 1s.

Original entry on oeis.org

34, 277, 2919, 30721, 314044, 3261576, 33703065, 348555744, 3605337986, 37285194645, 385624285944, 3988244570918, 41247771387074, 426598922843727, 4412031119622050, 45630745244822573, 471928833647029372, 4880850060681141219, 50479427900333015968, 522075580210608201142
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2017

Keywords

Examples

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

Crossrefs

Column 7 of A295918.