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.

A281798 Number of nX4 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

3, 38, 372, 1916, 8354, 32524, 117401, 404594, 1345667, 4351562, 13766102, 42771530, 130923764, 395755820, 1183519011, 3506644006, 10305848743, 30072612682, 87197043981, 251401262840, 721134389016, 2059017606124
Offset: 1

Views

Author

R. H. Hardin, Jan 30 2017

Keywords

Comments

Column 4 of A281802.

Examples

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

Crossrefs

Cf. A281802.

Formula

Empirical: a(n) = 11*a(n-1) -43*a(n-2) +57*a(n-3) +39*a(n-4) -102*a(n-5) -89*a(n-6) -2*a(n-7) +400*a(n-8) +345*a(n-9) -801*a(n-10) -1371*a(n-11) +1684*a(n-12) +2038*a(n-13) -1700*a(n-14) -3196*a(n-15) -691*a(n-16) +6737*a(n-17) +5067*a(n-18) -10614*a(n-19) -10149*a(n-20) +14785*a(n-21) +11944*a(n-22) -14624*a(n-23) -14589*a(n-24) +4290*a(n-25) +23532*a(n-26) +6761*a(n-27) -34960*a(n-28) -8032*a(n-29) +45464*a(n-30) -550*a(n-31) -43699*a(n-32) +12453*a(n-33) +25491*a(n-34) -16122*a(n-35) -7485*a(n-36) +9435*a(n-37) -84*a(n-38) -2737*a(n-39) +866*a(n-40) +422*a(n-41) -207*a(n-42) +27*a(n-44) for n>51