134043

Appears in sequences

• T(2n,n), where T is the array defined in A024996.at n=8A026073
• a(n) = T(n,[ n/2 ]), where T is the array defined in A024996.at n=16A026078
• a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.at n=4A075044
• a(n) is the first term in the first chain of at least n consecutive numbers each having exactly four distinct prime factors.at n=3A087977
• Smallest number k such that omega(k)+ omega(k+1)+ omega(k+2)+ omega(k+3)= n.at n=13A175206
• Initial term of first run of exactly n consecutive numbers with 4 distinct prime factors.at n=3A185042
• 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.at n=18A375287
• Smallest numbers k such that 2^k-1 when written in ternary contains its least significant zero in position n.at n=23A391268