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.

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

Original entry on oeis.org

10, 98, 968, 8706, 83074, 773348, 7272142, 68138974, 639248556, 5994907930, 56226693158, 527340415924, 4945869727454, 46386705274750, 435055533728012, 4080334184200118, 38268976277521222, 358920216579635816
Offset: 1

Views

Author

R. H. Hardin Oct 09 2012

Keywords

Comments

Column 5 of A217637

Examples

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