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.

A281767 Number of 3Xn 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

0, 10, 47, 152, 609, 2138, 7466, 25798, 87397, 293470, 979311, 3235714, 10650401, 34842532, 113507950, 368400482, 1191351902, 3841448788, 12352142633, 39620840414, 126807886700, 405026431154, 1291283976919, 4109819232304
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2017

Keywords

Comments

Row 3 of A281765.

Examples

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

Crossrefs

Cf. A281765.

Formula

Empirical: a(n) = 6*a(n-1) +7*a(n-2) -80*a(n-3) -60*a(n-4) +610*a(n-5) +488*a(n-6) -2954*a(n-7) -2778*a(n-8) +9782*a(n-9) +10423*a(n-10) -24116*a(n-11) -27411*a(n-12) +46820*a(n-13) +54750*a(n-14) -74006*a(n-15) -87429*a(n-16) +97522*a(n-17) +114272*a(n-18) -108436*a(n-19) -124098*a(n-20) +102206*a(n-21) +112813*a(n-22) -81722*a(n-23) -85782*a(n-24) +55064*a(n-25) +54233*a(n-26) -30842*a(n-27) -28193*a(n-28) +14078*a(n-29) +11842*a(n-30) -5088*a(n-31) -3915*a(n-32) +1398*a(n-33) +977*a(n-34) -274*a(n-35) -172*a(n-36) +34*a(n-37) +19*a(n-38) -2*a(n-39) -a(n-40) for n>41