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.

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

Original entry on oeis.org

10, 108, 1046, 10246, 99934, 975296, 9519284, 92918894, 907013406, 8853740672, 86425318934, 843636853718, 8235125319032, 80386833101166, 784692748485262, 7659745900162448, 74770293910981462, 729867143111233166
Offset: 1

Views

Author

R. H. Hardin Oct 19 2012

Keywords

Comments

Column 5 of A218064

Examples

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

Formula

Empirical: a(n) = 15*a(n-1) -56*a(n-2) +37*a(n-3) +117*a(n-4) -132*a(n-5) -128*a(n-6) +164*a(n-7) +60*a(n-8) -76*a(n-9) -4*a(n-10) +8*a(n-11) for n>13