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.

A231852 Number of nX5 0..2 arrays with no element having a strict majority of its horizontal and antidiagonal neighbors equal to itself plus one mod 3, with upper left element zero (rock paper and scissors drawn positions).

Original entry on oeis.org

21, 612, 85288, 11149456, 1454768048, 189801034186, 24762957054535, 3230773305296573, 421512520908365354, 54993894395631067868, 7174943262940390093175, 936100477964636376119044
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2013

Keywords

Comments

Column 5 of A231855

Examples

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

Formula

Empirical: a(n) = 183*a(n-1) -8008*a(n-2) +164477*a(n-3) -1911762*a(n-4) +13545983*a(n-5) -59779265*a(n-6) +159414566*a(n-7) -218855372*a(n-8) +7532104*a(n-9) +451112826*a(n-10) -590711864*a(n-11) +106059884*a(n-12) +386076754*a(n-13) -374591713*a(n-14) +131217119*a(n-15) +37977619*a(n-16) -86897128*a(n-17) +54663372*a(n-18) -17127366*a(n-19) +3057852*a(n-20) -413220*a(n-21) for n>22