Square array T(n, k), n > 1 and k >= 1, read by upward antidiagonals, give the smallest number that starts a sequence of exactly k consecutive numbers, each having exactly n distinct prime factors (counted without multiplicity), or -1 if no such number exists.

A375287

Square array T(n, k), n > 1 and k >= 1, read by upward antidiagonals, give the smallest number that starts a sequence of exactly k consecutive numbers, each having exactly n distinct prime factors (counted without multiplicity), or -1 if no such number exists.

Terms

    a(0) =6a(1) =30a(2) =14a(3) =210a(4) =230a(5) =20a(6) =2310a(7) =7314a(8) =644a(9) =33a(10) =30030a(11) =254540a(12) =37960a(13) =1308a(14) =54a(15) =510510a(16) =11243154a(17) =1042404a(18) =134043a(19) =2664a(20) =91a(21) =9699690a(22) =965009045a(23) =323567034a(24) =21871365a(25) =357642a(26) =6850a(27) =323a(28) =223092870a(29) =65893166030

External references