965009045

Appears in sequences

• a(n) = smallest number m such that m and m+1 are the product of exactly n distinct primes.at n=6A052215
• a(n) is the smallest number m such that each of the numbers m and m+1 has n distinct prime divisors.at n=6A093548
• a(n) is the first term in a chain of at least n consecutive numbers each with exactly 7 distinct prime factors.at n=1A138207
• Numbers m such that both m and m+1 have at least 7 distinct prime factors.at n=0A321489
• 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=22A375287