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.
64, 288, 5338, 66978, 975296, 14096488, 204211050, 2978543964, 43337429212, 631708431924, 9201998558182, 134096314110712, 1953815660270370, 28469970831713488, 414834864922566790, 6044649160655242312
Offset: 1
Keywords
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
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Comments