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.

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

Original entry on oeis.org

64, 288, 5338, 66978, 975296, 14096488, 204211050, 2978543964, 43337429212, 631708431924, 9201998558182, 134096314110712, 1953815660270370, 28469970831713488, 414834864922566790, 6044649160655242312
Offset: 1

Views

Author

R. H. Hardin Oct 19 2012

Keywords

Comments

Row 6 of A218064

Examples

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