highly abundant numbers

[D. S. McNeil]

In case anyone missed it, there was a fun MathOverflow question over the last week: https://mathoverflow.net/questions/501066/is-the-least-common-multiple-sequence-textlcm1-2-dots-n-a-subset-of-t

It's about whether lcm(1,2,...,n) is always highly abundant, about which I guessed wrong when I first saw the problem!  

Terry Tao got interested, and then everyone got interested polymath-style (#piedpiper), with guest appearances from some regulars.  The full problem is mostly settled now, with only verifications and compressions still going on.

Now this is https://oeis.org/A389482 thanks to Max.

Tao describes some of it here:

https://mathstodon.xyz/@tao/115306424727150237

https://mathstodon.xyz/@tao/115316787727719049  

It's a good example of people throwing all sorts of different techniques, some surprisingly basic, at a problem to make progress, and unlike a lot of MO questions the problem is comprehensible to casuals!

It also has relevance to uses of LLMs in math.

Doug