[seqfan] nXk 1..Q matrices with each value adjacent to each other value

[Ron Hardin]

So far it seems like a difficult computational problem - T(n,k) = maximal number 
Q in a 1..Q nXk array such that every value appears at least once adjacent to 
every other value.

Some tiny n,k maximal Q solutions with Q=2,3,4,5,6


All.solutions.for.1X2..
..1..2....2..1..
Some.solutions.for.2X2..
..1..1....1..1....1..2....1..2....1..2....1..3....1..3....1..3....2..1....2..1..
..2..3....3..2....1..3....3..2....3..3....1..2....2..2....2..3....2..3....3..1..
Some.solutions.for.3X2..
..1..3....1..3....1..2....1..2....1..4....1..4....3..1....3..1....3..2....3..2..
..2..4....4..2....3..4....4..3....3..2....2..3....2..4....4..2....1..4....4..1..
..3..1....3..1....2..1....2..1....4..1....4..1....1..3....1..3....2..3....2..3..
Some.solutions.for.3X3..
..1..2..3....1..2..3....1..2..3....1..2..3....1..2..4....1..2..4....1..2..4..
..3..4..5....3..5..4....4..5..1....5..4..1....3..5..1....4..3..5....4..5..3..
..5..1..2....4..1..2....2..3..4....2..3..5....2..4..3....5..1..2....3..1..2..
Some.solutions.for.3X4..
..1..2..4..6....1..2..4..5....1..2..4..3....1..2..4..6....1..2..4..6..
..3..4..5..2....3..4..6..2....3..2..5..6....3..2..5..1....3..2..5..3..
..5..1..6..3....6..1..5..3....5..6..1..4....5..6..3..4....5..6..1..4..

 rhhardin at mindspring.com
rhhardin at att.net (either)