A183550 Number of nX5 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
15, 1325, 46841, 1728533, 63868351, 2359134621, 87176303417, 3221377019429, 119037100116183, 4398697422258081, 162542044954494221, 6006305685720331925, 221946939432242106215, 8201454756620862955585, 303062796878789833114397
Offset: 1
Keywords
Examples
Some solutions for 3X5 ..1..1..0..0..1....2..2..2..0..0....0..0..1..1..1....1..1..0..0..0 ..0..0..0..0..1....2..2..1..2..2....0..1..0..2..2....0..0..2..0..1 ..1..1..0..1..1....0..0..1..1..2....1..1..0..0..2....2..2..2..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..200
Comments