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 A083002 #23 Jan 21 2023 02:27:39
%S A083002 2,6,30,210,4290,43890,510510,53501910,1487683470,64790866140,
%T A083002 530514844860,126408523110870,3425113062060690,660393717163700520,
%U A083002 26657280574571657010,3448055881024876471350,308480161111936386482910
%N A083002 Smallest oblong number having at least n distinct prime divisors.
%C A083002 a(18) <= 32521466098360753728404190. - _Donovan Johnson_, Oct 05 2011
%C A083002 Oblong numbers are those of the form n(n+1) = A002378(n) = 2*A000217(n).
%e A083002 a(4)= 210 = 2*3*5*7.
%o A083002 (PARI) {odf(m) = print1(0","); for(n=1,m, k=1; while(omega(k*(k+1))!=n,k++); print1(k*(k+1)",")) }
%Y A083002 Cf. A002378, A059958.
%K A083002 nonn
%O A083002 1,1
%A A083002 _Jason Earls_, May 30 2003
%E A083002 More terms from _Don Reble_, Jun 03 2003
%E A083002 a(15)-a(16) from _Donovan Johnson_, Apr 26 2009
%E A083002 a(17) from _Donovan Johnson_, Sep 15 2010