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.

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

Original entry on oeis.org

6, 42, 260, 1664, 10566, 66978, 424332, 2687866, 17025060, 107835994, 683025864, 4326234664, 27402037744, 173562384900, 1099330676692, 6963075143418, 44103577188722, 279348632561274, 1769372542444278, 11207068261293544
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2012

Keywords

Comments

Column 4 of A218064.

Examples

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

Crossrefs

Cf. A218064.

Formula

Empirical: a(n) = 9*a(n-1) - 18*a(n-2) + 6*a(n-3) + 7*a(n-4) - 2*a(n-5) - a(n-6) for n>7.
Empirical g.f.: 2*x*(3 - 6*x - 5*x^2 + 22*x^3 - 12*x^4 - 3*x^5 + 2*x^6) / ((1 - x)*(1 - 8*x + 10*x^2 + 4*x^3 - 3*x^4 - x^5)). - Colin Barker, Jul 23 2018