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 A337645 #21 Oct 17 2020 05:38:31 %S A337645 2,6,10,10,10,10,10,10,10,18,20,20,20,20,24,24,24,24,24,24,24,24,24, %T A337645 24,24,24,24,24,24,24,24,24,24,24,36,36,36,36,44,44,44,44,48,48,48,48, %U A337645 48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,54 %N A337645 a(1)=2; thereafter, a(n) = smallest number with at least two different prime factors that is missing from A336957 after A336957(n) has been found. %C A337645 The initial 2 is an exception. For n>2, A336957(n) is required to have at least two different prime factors. %C A337645 It is conjectured that every number with at least two different prime factors will eventually appear in A336957. %H A337645 N. J. A. Sloane, <a href="/A337645/b337645.txt">Table of n, a(n) for n = 1..20000</a> %e A337645 A336957 begins 1, 2, 6, 15, 35, 14, with A336957(6)=14. At that point 10 is the smallest legal candidate that has not yet appeared, so a(6) = 10. %Y A337645 Cf. A336957, A338052, A338058. %K A337645 nonn %O A337645 1,1 %A A337645 _Scott R. Shannon_ and _N. J. A. Sloane_, Sep 25 2020; corrected Oct 11 2020