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 A328448 #9 Oct 18 2019 03:45:43
%S A328448 2,6,12,504,60,420,840,4084080,2520,21162960,27720,2059318800,0,
%T A328448 360360,720720,8494326640800,12252240,281206918792800,0,0,232792560,
%U A328448 409547311252279200,5354228880,619808900849199341280,26771144400,54749786241679275146400,80313433200,5663770990518545704800
%N A328448 Smallest number whose divisors > 1 have a longest run of length n, and 0 if none exists.
%e A328448 The runs of divisors of 504 (greater than 1) are {{2,3,4},{6,7,8,9},{12},{14},{18},{21},{24},{28},{36},{42},{56},{63},{72},{84},{126},{168},{252},{504}}, the longest of which has length 4, and 504 is the smallest number with this property, so a(4) = 504.
%Y A328448 The version that looks at all divisors (including 1) is A328449.
%Y A328448 The longest run of divisors of n greater than 1 has length A328457.
%Y A328448 Numbers whose divisors > 1 have no non-singleton runs are A088725.
%Y A328448 The number of successive pairs of divisors of n is A129308(n).
%Y A328448 The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
%Y A328448 Cf. A000005, A027750, A055874, A060680, A181063, A199970, A328450.
%K A328448 nonn
%O A328448 1,1
%A A328448 _Gus Wiseman_, Oct 16 2019
%E A328448 Data corrected and extended by _Giovanni Resta_, Oct 18 2019