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 A328450 #7 Oct 18 2019 16:45:20
%S A328450 1,2,6,12,60,72,180,360,420,840,1260,2520,3780,5040,13860,27720,36960,
%T A328450 41580,55440,83160,166320,277200,360360,471240,491400,720720,1081080,
%U A328450 1113840,2162160,2827440,3341520,4324320,5405400,6126120
%N A328450 Numbers that are a smallest number with k pairs of successive divisors, for some k.
%C A328450 A sorted version of A287142.
%e A328450 The divisors of 72 are {1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72}, with pairs of successive divisors {{1, 2}, {2, 3}, {3, 4}, {8, 9}}, and no smaller number has 4 successive pairs, so 72 belongs to the sequence.
%t A328450 dat=Table[Count[Differences[Divisors[n]],1],{n,10000}];
%t A328450 Sort[Table[Position[dat,i][[1,1]],{i,Union[dat]}]]
%Y A328450 Sorted positions of first appearances in A129308.
%Y A328450 The longest run of divisors of n has length A055874(n).
%Y A328450 Numbers whose divisors > 1 have no non-singleton runs are A088725.
%Y A328450 The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
%Y A328450 The smallest number whose divisors have a longest run of length n is A328449(n).
%Y A328450 Cf. A000005, A003601, A027750, A033676, A060680, A060681, A072627, A181063, A199970, A287142, A328165.
%K A328450 nonn
%O A328450 0,2
%A A328450 _Gus Wiseman_, Oct 15 2019