A350049 a(1) = 1; for n > 1, a(n) is the smallest number with at least as many divisors as 2*a(n-1).

1, 2, 4, 6, 12, 24, 48, 60, 120, 240, 360, 720, 1260, 2520, 5040, 10080, 20160, 27720, 55440, 110880, 221760, 332640, 665280, 1081080, 2162160, 4324320, 8648640, 17297280, 21621600, 43243200, 73513440, 147026880, 294053760, 367567200, 735134400, 1396755360, 2793510720

Offset

1,2

Comments

Identical to A019505 for 63 terms. A019505(64) = 97039187544499200 (the smallest number with exactly 63360 divisors), but a(64) = 74801040398884800 (the smallest number with at least 63360 divisors; its actual number of divisors is 64512).

Subsequence of A002182.

Links

Table of n, a(n) for n=1..37.

Michael De Vlieger, Concordance of a(n) and A002182, n = 1..10000, terms compactified via A067255 for log_10(a(n)) > 33, giving indices in A002182 and number of divisors of first 1000 terms.

Crossrefs

Cf. A019505, A002182, A139770.

Sequence in context: A208767 A136339 A019505 * A135614 A115387 A095849

Adjacent sequences: A350046 A350047 A350048 * A350050 A350051 A350052

Keyword

nonn

Author

J. Lowell, Dec 11 2021

Status

approved