146216247221
domain: N
Appears in sequences
- Let d(n) = number of distinct primes dividing n (A001221). Find smallest t such that d(t)=d(t+1)=...=d(t+n-1) but d(t-1) and d(t+n) are not = d(t); then a(n)=t.at n=17A048932
- a(n) is the first number in the first run of at least n successive numbers, all having exactly 3 distinct prime factors.at n=17A080569
- Initial term of first run of exactly n consecutive numbers with 3 distinct prime factors.at n=17A185032