147026880

Appears in sequences

• a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1).at n=31A019505
• a(n) = (4*n+10)(!^4)/10(!^4), related to A000407 ((4*n+2)(!^4) quartic, or 4-factorials).at n=6A051622
• Superabundant numbers (A004394) that are not colossally abundant (A004490).at n=30A189228
• Where records occur in A129308 and also in A195155.at n=29A195307
• Numbers k such that sigma(k) > 5*k.at n=1A215264
• Primitive part of n! (for n>=1): n! = Product_{d|n} a(d).at n=17A250269
• a(n) = Product_{d divides n} ((d-1)!)^moebius(n/d).at n=17A253901
• Primitive 5-abundant numbers: Numbers k such that sigma(k) > 5k (A215264) all of whose proper divisors d are 5-deficient numbers (having sigma(d) < 5d).at n=1A307115
• Partial products of A334393.at n=10A334395
• Numbers in A166981 that are neither superior highly composite nor colossally abundant.at n=30A338786
• Ramanujan's highly composite numbers A002182 sandwiched between nonprimes.at n=21A340580
• a(1) = 1; for n > 1, a(n) is the smallest number with at least as many divisors as 2*a(n-1).at n=31A350049
• Highly composite numbers (A002182) whose number of divisors is not a multiple of 3.at n=23A354216
• Smallest n-layered number.at n=4A355757
• Partial products of A115975.at n=10A375269
• a(n) is the smallest k such that tau(2*k) is equal to 2^n, where tau = A000005.at n=9A380836
• Positive integers k such that the set {d+k/d : d|k} contains four consecutive integers.at n=6A386303