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.

A295777 Number of nX4 0..1 arrays with each 1 adjacent to 0 or 2 king-move neighboring 1s.

Original entry on oeis.org

8, 49, 198, 1059, 5263, 25529, 127731, 630988, 3118368, 15452696, 76444609, 378316752, 1872559828, 9266918261, 45863407707, 226985095214, 1123365612319, 5559672436516, 27515436853783, 136176807358073, 673954171761877
Offset: 1

Views

Author

R. H. Hardin, Nov 27 2017

Keywords

Comments

Column 4 of A295781.

Examples

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

Crossrefs

Cf. A295781.

Formula

Empirical: a(n) = 4*a(n-1) +6*a(n-2) +6*a(n-3) -58*a(n-4) -20*a(n-5) +29*a(n-6) -92*a(n-7) +7*a(n-8) +2*a(n-9) -2*a(n-10)