6306300

Appears in sequences

• Least m such that A080256(m)=n and has a maximum number A000792(n) of divisors.at n=14A087902
• Cubefree part of n!.at n=13A145642
• Denominator of the 2n-th raw moment for distribution of distances between two points picked at random in the interior of a unit cube.at n=6A160694
• Smallest integer with exactly n semiprime divisors.at n=19A220264
• Cubefree products of primorials (A002110).at n=28A220423
• Triangle read by rows: T(n,k) (n>=2, 1<=k<=n-1) is the number of unordered pairs of vertices at distances k in the odd graph O_n.at n=26A228308
• If 2n = 2^e1 + 2^e2 + ... + 2^ek [e1 .. ek distinct], then a(n) = A002110(e1) * A002110(e2) * ... * A002110(ek).at n=40A283477
• Recursive highly composite numbers: numbers with a record number of recursive divisors (A282446).at n=24A333931
• Numbers in A037019 that are not the same as the corresponding number in A005179.at n=26A347828
• Indices of records in A353898.at n=23A353899
• a(n) = denominator(Sum_{j=0..n} Bernoulli(j, 1) * Bernoulli(n - j, 1)).at n=12A363151
• a(n) = denominator(Sum_{j=0..2*n} Bernoulli(j, 1) * Bernoulli(2*n - j, 1)).at n=6A363152
• 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=23A364878
• a(n) = Sum_{k=0..n} A369134(n, k).at n=7A369120
• Expansion of e.g.f. 1 / (1 + x * log(1 - x^4/24)).at n=14A375558
• Numbers that have more cubefree divisors than any smaller number.at n=22A377139
• a(n) is the least number that has exactly n exponential abundant divisors.at n=28A389299