281291010

Appears in sequences

• Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.at n=37A048692
• Smallest s for which there are exactly n primitive Pythagorean triangles with perimeter 2s; i.e., smallest s such that A078926(s) = n.at n=12A078927
• Products of 9 distinct primes.at n=1A115343
• Table read by ascending antidiagonals: n-th row of table consists of the positive integers divisible by exactly n distinct primes.at n=46A125666
• Partial products of A185956.at n=8A185693
• Least r > 1 without Goldbach partition 2r = p+q such that |p-q| is prime(n)-smooth.at n=10A217016
• Sum over all partitions lambda of n into 9 distinct parts of Product_{i:lambda} prime(i).at n=1A258364
• "Near Primorial" numbers.at n=35A259629
• 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=53A274608
• 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=30A288813
• a(n) is the smallest k such that psi(k) and phi(k) have same distinct prime factors when k is the product of n distinct primes (psi(k) = A001615(k) and phi(k) = A000010(k)), or 0 if no such k exists.at n=8A291138
• a(n) = primorial prime(n)#/prime(n - 1).at n=8A306237
• Numbers k such that omega(k) = 9.at n=1A348073
• Numbers of the form A002110(k)/prime(i); i = 2..k-1; sorted.at n=28A372666
• Numbers whose unitary divisors have a mean unitary abundancy index that is larger than 2.at n=1A374785