Irregular table read by rows: T(n,k) is the smallest m that has 2*n divisors and is at the beginning of a run of exactly k consecutive integers whose number of divisors increases by 2, or -1 if no such m exists.

A363335

Irregular table read by rows: T(n,k) is the smallest m that has 2*n divisors and is at the beginning of a run of exactly k consecutive integers whose number of divisors increases by 2, or -1 if no such m exists.