526095

Appears in sequences

• Numbers n such that n through n+9 are divisible by the same number of distinct primes.at n=12A045938
• Numbers k such that n or more consecutive integers starting at k have the same number of distinct prime divisors.at n=11A045983
• Numbers k such that n or more consecutive integers starting at k have the same number of distinct prime divisors.at n=12A045983
• Numbers k such that n or more consecutive integers starting at k have the same number of distinct prime divisors.at n=13A045983
• 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=13A048932
• Duplicate of A045983.at n=11A075042
• Duplicate of A045983.at n=12A075042
• Duplicate of A045983.at n=13A075042
• 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=11A080569
• 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=12A080569
• 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=13A080569
• Initial term of first run of exactly n consecutive numbers with 3 distinct prime factors.at n=13A185032
• Smallest positive number k such that there are exactly n successive equal values of A001221 starting at k, i.e., such that A305234(k) = n.at n=13A305235