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 A273415 #19 May 09 2021 02:27:41 %S A273415 10,4680,6585701522400,193394747145600,27377180785991836800, %T A273415 29378941900252048776672000,5384823686347760468943298225056000, %U A273415 404593694258692410380118300618528000,1714431214566179268370439406441900195214656000,180656647480221782329653424360823828484237888000 %N A273415 The smallest term of A273379 having n primes between two consecutive prime divisors. %C A273415 Is this sequence infinite? %C A273415 In the prime factorization of a(n), the 'gap' occurs before the largest prime divisor. For example, 4680 has distinct prime divisors 2, 3, 5 and 13. The gap is before the largest prime 13. All primes up to and including the second largest prime are a divisor of a(n). %H A273415 P. Erdős, <a href="https://www.renyi.hu/~p_erdos/1944-04.pdf">On Highly composite numbers</a>, J. London Math. Soc. 19 (1944), 130--133 MR7,145d; Zentralblatt 61,79. %H A273415 Vladimir Shevelev, <a href="http://arxiv.org/abs/1605.08884">On Erdős constant</a>, arXiv:1605.08884 [math.NT], 2016. %Y A273415 Cf. A067128, A273379. %K A273415 nonn %O A273415 1,1 %A A273415 _David A. Corneth_, May 22 2016