A218064 T(n,k) = Number of n X k arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 n X k array.
2, 2, 4, 4, 6, 8, 6, 18, 16, 16, 10, 42, 74, 42, 32, 16, 108, 260, 308, 110, 64, 26, 268, 1046, 1664, 1282, 288, 128, 42, 676, 3974, 10246, 10566, 5338, 754, 256, 68, 1694, 15578, 60804, 99934, 66978, 22228, 1974, 512, 110, 4258, 60242, 368220, 925904, 975296
Offset: 1
Examples
Some solutions for n=3, k=4 ..1..0..0..0....0..0..1..0....1..1..1..1....0..0..0..0....1..0..0..0 ..1..0..1..0....0..0..0..0....1..1..0..0....1..1..0..0....0..0..0..0 ..0..0..0..0....1..0..0..1....1..0..0..0....0..0..0..0....1..1..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..262
Comments