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.

A218900 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 4Xn array.

Original entry on oeis.org

16, 38, 286, 1096, 6280, 28598, 149238, 722094, 3651696, 18021788, 90208322, 448024152, 2235168520, 11123412124, 55435126828, 276050589212, 1375270796150, 6849815881386, 34121765700892, 169961133958828, 846617625629670
Offset: 1

Views

Author

R. H. Hardin Nov 08 2012

Keywords

Comments

Row 4 of A218897

Examples

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

Formula

Empirical: a(n) = 3*a(n-1) +16*a(n-2) -16*a(n-3) -51*a(n-4) -107*a(n-5) -115*a(n-6) +457*a(n-7) +511*a(n-8) +617*a(n-9) -294*a(n-10) -2046*a(n-11) -1191*a(n-12) -307*a(n-13) +1059*a(n-14) +3506*a(n-15) -419*a(n-16) -2054*a(n-17) -800*a(n-18) -301*a(n-19) +699*a(n-20) +1069*a(n-21) +108*a(n-22) -403*a(n-23) -292*a(n-24) -177*a(n-25) +156*a(n-26) +98*a(n-27) +52*a(n-28) -72*a(n-29) +8*a(n-30)