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.

A279706 Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

3, 6, 47, 385, 3245, 27346, 230128, 1936687, 16300179, 137192011, 1154685911, 9718495665, 81796457512, 688446233557, 5794361407059, 48768695462933, 410465538968189, 3454715318219146, 29076881764570866, 244727850397713496
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2016

Keywords

Comments

Column 5 of A279709.

Examples

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

Crossrefs

Cf. A279709.

Formula

Empirical: a(n) = 17*a(n-1) -107*a(n-2) +388*a(n-3) -991*a(n-4) +1845*a(n-5) -2506*a(n-6) +2365*a(n-7) -1546*a(n-8) +695*a(n-9) -219*a(n-10) +44*a(n-11) -4*a(n-12) for n>13