15315300

Appears in sequences

• a(n) = 21*(n+1)*binomial(n+4,9).at n=9A027805
• a(n) = 55*(n+1)*binomial(n+4,12).at n=6A027808
• Denominator of Sum_{k=1..n} (-1)^k / semiprime(k).at n=11A140123
• Denominator of Sum_{k=1..n} (-1)^k / semiprime(k).at n=12A140123
• a(n) = lcm(first n semiprimes).at n=11A164853
• a(n) = lcm(first n semiprimes).at n=12A164853
• Members m of A025487 such that, if k appears in m's prime signature, k-1 appears at least as often as k (for any integer k > 1).at n=30A182863
• Smallest integer with exactly n semiprime divisors.at n=24A220264
• Cubefree products of primorials (A002110).at n=30A220423
• a(n) = A278222(n^3).at n=57A286375
• Cubefree superabundant numbers: cubefree numbers (A004709) k such that sigma(k)/k > sigma(j)/j for all cubefree numbers j < k.at n=18A308618
• Cubefree colossally superabundant numbers: cubefree numbers (A004709) k for which there is a positive exponent epsilon such that sigma(k)/k^{1 + epsilon} >= sigma(j)/j^{1 + epsilon} for all cubefree j > 1, so that k attains the maximum value of sigma(k)/k^{1 + epsilon} over the cubefree numbers.at n=9A309875
• Recursive highly composite numbers: numbers with a record number of recursive divisors (A282446).at n=26A333931
• Squares of terms are the intersection of A025487 and A217584.at n=9A333969
• a(n) is the least positive integer divisible by exactly n primitive nondeficient numbers (A006039).at n=27A337691
• Least integers of their prime signature (A025487) whose average number of distinct prime factors of their divisors is an integer.at n=14A346015
• Numbers in A037019 that are not the same as the corresponding number in A005179.at n=31A347828
• Indices of records in A353898.at n=25A353899
• Triangle read by rows: T(n,k), 0 <= k <= n, is the smallest number that has n distinct prime factors, k of which are unique.at n=32A364878
• Numbers that have more cubefree divisors than any smaller number.at n=23A377139