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.

A218066 Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 3Xn array.

Original entry on oeis.org

8, 16, 74, 260, 1046, 3974, 15578, 60242, 234468, 910060, 3536762, 13737348, 53371468, 207332364, 805465810, 3129084596, 12156035112, 47224200410, 183458638422, 712707497212, 2768755861210, 10756176540402, 41786039888224
Offset: 1

Views

Author

R. H. Hardin Oct 19 2012

Keywords

Comments

Row 3 of A218064

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) +11*a(n-2) -7*a(n-3) -34*a(n-4) +11*a(n-5) +49*a(n-6) -14*a(n-7) -36*a(n-8) +7*a(n-9) +a(n-10) +8*a(n-11) +2*a(n-12) -13*a(n-13) +2*a(n-14) +4*a(n-15) for n>18