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 A181309 #8 Mar 30 2012 17:27:19 %S A181309 1084045767585249647898720000,63958700287529729226024480000, %T A181309 6086309919361329033148489516800,30431549596806645165742447584000, %U A181309 241271469053348685089061371928480000 %N A181309 Highly composite numbers that are not highly abundant numbers. %C A181309 Numbers in A002182 but not in A002093. These terms are A002182(n) for n=255, 278, 301, 312, 362. %C A181309 From _Matthew Vandermast_: Alaoglu and Erdos state on page 463 (just before Theorem 18) that "only a finite number of highly abundant numbers can be highly composite." What is the largest number in the intersection of the two sequences? %H A181309 T. D. Noe, <a href="/A181309/b181309.txt">Table of n, a(n) for n=1..10</a> %H A181309 L. Alaoglu and P. Erdos, <a href="http://www.renyi.hu/~p_erdos/1944-03.pdf">On highly composite and similar numbers,</a> Trans. Amer. Math. Soc., 56 (1944), 448-469. %e A181309 n1 = 1084045767585249647898720000 is not highly abundant because the smaller number %e A181309 n0 = 1082074775280549193993449600 has a larger sum of divisors: %e A181309 sigma(n1) = 7737797730196290039762124800 %e A181309 sigma(n0) = 7744678597340808238596096000 %K A181309 nonn %O A181309 1,1 %A A181309 _T. D. Noe_, Oct 13 2010