This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A092991 #23 May 01 2024 01:45:43
%S A092991 1,1,2,2,4,6,6,12,12,24,36,48,60,60,120,180,240,360,360,720,1080,1440,
%T A092991 2160,2880,2520,6480,5040,7560,10080,15120,20160,30240,45360,60480,
%U A092991 75600,120960,151200,226800,302400,453600,604800,907200,1209600,1814400
%N A092991 Least product of the parts of the partitions of n where that product has the maximum number of divisors.
%C A092991 Let P be the set of all products of partitions of n and t = max_{m in P} tau(m). Then a(n) = min_{m in P and tau(m) = t} m. Note that the sequence is not monotonic; the first decrease is a(26) = 5040 < 6480 = a(25) and the second is a(49) = 3326400 < 10886400 = a(48). - _Franklin T. Adams-Watters_, Jun 14 2006
%C A092991 All terms are in A025487. - _David A. Corneth_, Apr 30 2024
%H A092991 David A. Corneth, <a href="/A092991/b092991.txt">Table of n, a(n) for n = 0..945</a> (first 88 terms from Amiram Eldar)
%e A092991 a(9) = 24 corresponding to the partition (2,2,2,3).
%e A092991 a(8) = 12 corresponding to the partition (1,3,4). Another partition (3,3,2) gives a product 18 with same number of divisors 6 but 18>12 hence a(8) = 12.
%t A092991 a[n_] := Module[{t = Transpose[{t = Times @@@ IntegerPartitions[n], DivisorSigma[0, t]}]}, MaximalBy[SortBy[t, Last], Last, 1][[1, 1]]]; Array[a, 50, 0] (* _Amiram Eldar_, Apr 13 2024 *)
%Y A092991 Cf. A092990.
%Y A092991 Cf. A000005, A025487, A118851.
%K A092991 nonn
%O A092991 0,3
%A A092991 _Amarnath Murthy_, Mar 28 2004
%E A092991 Corrected and extended by _Franklin T. Adams-Watters_, Jun 14 2006