746130

Appears in sequences

• Smallest number beginning with n and having n different prime divisors (which may be repeated).at n=6A011753
• Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.at n=24A048692
• Greatest common divisor of largest square dividing n! and squarefree part of n!.at n=56A055230
• 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=3A076253
• Triangle read by rows: T(n,k) = A002110(n)/prime(n+1-k), k = 1..n.at n=30A077011
• Smallest number beginning with 7 and having exactly n distinct prime divisors.at n=6A077332
• Smallest number beginning with n and having exactly n prime divisors, all distinct.at n=6A077522
• First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.at n=34A091350
• Smallest number beginning with 7 that is the product of exactly n distinct primes.at n=6A106417
• Triangle T(n,k) read by rows: T(n,0) = A002110(n) and T(n,k) = A002110(n)/prime(k) for 1<=k<=n.at n=42A121281
• Products of 7 distinct primes (squarefree 7-almost primes).at n=3A123321
• Numbers that are divisible by exactly 7 distinct primes.at n=3A176655
• Largest number that can be encoded as Product_{i:lambda} prime(i) for a partition lambda of n into distinct parts.at n=30A246868
• Numbers n such that n = concatenate(a, b) and sigma(a) + sigma(b) = phi(n).at n=25A249065
• Triangle in which n-th row contains all possible products of n-1 of the first n primes in descending order.at n=33A258566
• "Near Primorial" numbers.at n=21A259629
• Number of different 3 against 3 matches given n players.at n=22A271040
• T(n, k) is the largest number that can be formed by multiplying k primes prime(i1+0),...,prime(ik+k-1) such that i1+...+ik = n. Triangle read by rows.at n=42A274608
• Irregular triangle read by rows: T(m, k) is the list of squarefree numbers A002110(m) < t < 2*A002110(m) such that A001221(t) = m.at n=16A288813
• a(n) is the smallest number k such that psi(k) = n*phi(k) where psi(k) is Dedekind psi function (A001615) and phi(k) is Euler totient function (A000010), or 0 if no such k exists.at n=17A291051