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 A000423 #27 Aug 04 2022 05:53:25
%S A000423 2,3,6,12,18,24,36,48,54,72,96,108,144,162,192,216,288,324,384,432,
%T A000423 486,576,648,768,864,972,1152,1296,1458,1536,1728,1944,2304,2592,2916,
%U A000423 3072,3456,3888,4374,4608,5184,5832,6144,6912,7776,8748,9216,10368,11664
%N A000423 a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.
%C A000423 Sequence contains 2, 3 and all numbers of form 2^a*3^b where a >= 1 and b >= 1. - _David W. Wilson_, Aug 15 1996
%C A000423 Main entry for this sequence is A033845, which is this sequence starting at 6. - _Charles R Greathouse IV_, Feb 27 2012
%D A000423 Amarnath Murthy, The sum of the reciprocals of the Smarandache multiplicative sequence, (to be published in Smarandache Notions Journal).
%D A000423 F. Smarandache, "Properties of the Numbers", University of Craiova Archives, 1975; Arizona State University Special Collections, Tempe, AZ
%D A000423 M. Myers, Smarandache Multiplicative Numbers, in Memorables 1998, Bristol Banner Books, Bristol, p. 37, 1998.
%H A000423 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/Sequences-book.pdf">Sequences of Numbers Involved in Unsolved Problems</a>.
%F A000423 Sum_{n>=1} 1/a(n) = 4/3. - _Amiram Eldar_, Jul 31 2022
%t A000423 a[1] = 2; a[2] = 3; a[n_] := a[n] = For[k = a[n - 1] + 1, True, k++, If[ AnyTrue[Table[a[i] a[j], {i, 1, n-2}, {j, i+1, n-1}] // Flatten, # == k& ], Return[k]]]; Table[an = a[n]; Print[an]; an, {n, 1, 50}] (* _Jean-François Alcover_, Feb 08 2016 *)
%Y A000423 Subsequence of A003586 (3-smooth numbers).
%Y A000423 A007335 and A033845 are subsequences.
%K A000423 nonn,easy
%O A000423 1,1
%A A000423 R. Muller
%E A000423 More terms from _David W. Wilson_, Aug 15 1996