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.

A297222 Number of nX6 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 neighboring 1s.

Original entry on oeis.org

9, 69, 535, 4210, 33158, 261939, 2063378, 16277793, 128351805, 1012130530, 7981569963, 62939687472, 496326792470, 3913894569563, 30863877179841, 243384068190066, 1919259204181410, 15134747411461711, 119348431276698530
Offset: 1

Views

Author

R. H. Hardin, Dec 27 2017

Keywords

Comments

Column 6 of A297224.

Examples

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

Crossrefs

Cf. A297224.

Formula

Empirical: a(n) = a(n-1) +34*a(n-2) +146*a(n-3) +141*a(n-4) -184*a(n-5) -461*a(n-6) +413*a(n-7) -498*a(n-8) -119*a(n-9) +408*a(n-10) +144*a(n-11) for n>13