601380780

Appears in sequences

• a(n) = the least positive integer solution of the "n-th omega recurrence" omega(k) = omega(k-1) + ... + omega(k-n), if such k exists; = 0 otherwise. (omega(n) denotes the number of distinct prime factors of n.)at n=4A076253
• Smallest number beginning with 6 and having exactly n distinct prime divisors.at n=8A077331