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.

A232025 Number of 3Xn 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.

Original entry on oeis.org

27, 121, 852, 6443, 52680, 429976, 3466702, 27787183, 222389326, 1780673721, 14267000759, 114336941196, 916296529103, 7342802491841, 58840508065211, 471508681192630, 3778370050644605, 30277527214482376, 242625604992194944
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2013

Keywords

Comments

Row 3 of A232023

Examples

			Some solutions for n=5
..1..1..1..2..0....1..1..2..2..1....2..2..2..1..0....2..0..0..1..1
..1..1..2..0..0....0..0..0..0..0....0..0..0..0..1....0..0..0..0..0
..2..2..2..1..1....0..2..2..0..0....0..0..2..1..1....1..2..0..0..2
		

Formula

Empirical: a(n) = 27*a(n-1) -345*a(n-2) +2906*a(n-3) -18194*a(n-4) +89630*a(n-5) -358894*a(n-6) +1185747*a(n-7) -3260528*a(n-8) +7466097*a(n-9) -14160132*a(n-10) +21896170*a(n-11) -26633596*a(n-12) +23529983*a(n-13) -11654811*a(n-14) -723584*a(n-15) -1889472*a(n-16) +30150715*a(n-17) -76789441*a(n-18) +108264425*a(n-19) -86458925*a(n-20) -2171553*a(n-21) +134672418*a(n-22) -234146243*a(n-23) +241899114*a(n-24) -161267275*a(n-25) +17371932*a(n-26) +86178714*a(n-27) -121036721*a(n-28) +159172848*a(n-29) -142380806*a(n-30) +98877622*a(n-31) -56252050*a(n-32) -58219355*a(n-33) +89668896*a(n-34) -59655755*a(n-35) +88313022*a(n-36) -12314620*a(n-37) -52223803*a(n-38) -6093896*a(n-39) -8246178*a(n-40) +26031408*a(n-41) +11882831*a(n-42) +3875046*a(n-43) -10990860*a(n-44) -10242618*a(n-45) +3330927*a(n-46) +2031952*a(n-47) +1747833*a(n-48) +1001573*a(n-49) -1169345*a(n-50) -559815*a(n-51) +163580*a(n-52) +94865*a(n-53) +16502*a(n-54) -321*a(n-55) -4403*a(n-56) -1435*a(n-57) -16*a(n-58) +76*a(n-59) +28*a(n-60) +4*a(n-61) for n>64