A217999 T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.
3, 9, 9, 25, 81, 25, 81, 729, 729, 81, 241, 6561, 19665, 6561, 241, 719, 59049, 531143, 531143, 59049, 719, 2181, 531441, 14345273, 43046713, 14345273, 531441, 2181, 6543, 4782969, 387332417, 3486751263, 3486751263, 387332417, 4782969, 6543
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..2..2..0....0..2..2..2....0..2..1..1....0..0..0..2....0..1..0..2 ..1..0..2..0....0..2..0..0....1..2..0..1....0..1..1..0....0..0..1..2 ..1..0..0..0....0..2..2..0....1..1..0..1....2..2..0..0....2..0..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Crossrefs
Column 2 is 9^n, A001019
Comments