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 A005733 M1166 #30 Jul 08 2025 16:35:10
%S A005733 2,4,9,10,22,26,40,50,54,55,78,115,123,154,155,209,288,220,221,292,
%T A005733 301,378,494,494,551,715,670,786,805,803,1079,966,1190,1222,1274,1274,
%U A005733 1276,1771,1836,1807,1834,2147,2263,2519,2519,3021,3306,3306,3427,3441,3445
%N A005733 Least k such that binomial(k,n) has n or more distinct prime factors.
%C A005733 Table 3 in Selmer's paper has typos for n = 83, 100 and 117. - _T. D. Noe_, Apr 05 2007
%D A005733 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005733 T. D. Noe, <a href="/A005733/b005733.txt">Table of n, a(n) for n=1..1000</a>
%H A005733 Ernst S. Selmer, <a href="http://www.mscand.dk/article/viewFile/11662/9678">On the number of prime divisors of a binomial coefficient</a>, Math. Scand. 39 (1976), no. 2, 271-281.
%t A005733 Table[n=k; b=1; While[n++; b=b*n/(n-k); Length[FactorInteger[b]]<k]; n, {k,100}] (* _T. D. Noe_, Apr 05 2007 *)
%t A005733 lk[n_]:=Module[{k=n+1},While[PrimeNu[Binomial[k,n]]<n,k++];k]; Array[ lk,60] (* _Harvey P. Dale_, May 13 2018 *)
%Y A005733 Cf. A005735, A129233.
%K A005733 nonn
%O A005733 1,1
%A A005733 _N. J. A. Sloane_
%E A005733 Edited by _T. D. Noe_, Apr 05 2007