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.

A281717 Number of 3 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

4, 4, 8, 38, 90, 305, 902, 2710, 8376, 25226, 77145, 235122, 715882, 2186483, 6666846, 20353268, 62140942, 189739429, 579567532, 1770391431, 5409031357, 16528102350, 50508922108, 154369025240, 471828803722, 1442250315610, 4408832591287
Offset: 1

Views

Author

R. H. Hardin, Jan 28 2017

Keywords

Comments

Row 3 of A281715.

Examples

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

Crossrefs

Cf. A281715.

Formula

Empirical: a(n) = 3*a(n-1) +8*a(n-2) -16*a(n-3) -46*a(n-4) +39*a(n-5) +121*a(n-6) -66*a(n-7) -185*a(n-8) +78*a(n-9) +216*a(n-10) -71*a(n-11) -182*a(n-12) +51*a(n-13) +107*a(n-14) -24*a(n-15) -43*a(n-16) +7*a(n-17) +10*a(n-18) -a(n-19) -a(n-20) for n>21.