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.

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

Original entry on oeis.org

6, 34, 212, 1096, 6422, 35812, 202662, 1143320, 6451714, 36412818, 205486910, 1159668470, 6544517458, 36933689524, 208433556616, 1176284907448, 6638308849796, 37462983914486, 211420591173616, 1193142178688764
Offset: 1

Views

Author

R. H. Hardin, Nov 08 2012

Keywords

Comments

Column 4 of A218897.

Examples

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

Crossrefs

Cf. A218897.

Formula

Empirical: a(n) = 6*a(n-1) +3*a(n-2) -25*a(n-3) -29*a(n-4) +53*a(n-5) +33*a(n-6) +12*a(n-7) -38*a(n-8) -18*a(n-10) +12*a(n-11) -15*a(n-12) +7*a(n-13) +4*a(n-14).