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.

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

Original entry on oeis.org

1, 10, 43, 140, 494, 1845, 6757, 24479, 89068, 324765, 1182996, 4307440, 15687513, 57137761, 208098949, 757896766, 2760293603, 10053139616, 36613986582, 133349718469, 485665707449, 1768816633099, 6442109942616, 23462454583677
Offset: 1

Views

Author

R. H. Hardin, Jan 02 2018

Keywords

Comments

Row 2 of A297654.

Examples

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

Crossrefs

Cf. A297654.

Formula

Empirical: a(n) = 3*a(n-1) -2*a(n-2) +13*a(n-3) +6*a(n-4) +12*a(n-5) +12*a(n-6)