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 A322158 #23 Jan 04 2019 04:08:38
%S A322158 6,9,11,22,25,70,78,276,497,990,1771,8178,20504,44254,181051,416328,
%T A322158 1013728,3383579,8667726,34332376,122289552,244215150,969751302,
%U A322158 1865174676,6648863728,26888317326,107132035803
%N A322158 a(n) is the smallest m for which binomial(m,5) has exactly n distinct prime factors.
%C A322158 Binomial(m,5) is never prime, so the offset is 2.
%t A322158 a[n_] := Module[{m = 5}, While[PrimeNu[Binomial[m, 5]] != n, m++]; m]; Array[a, 10, 2] (* _Amiram Eldar_, Nov 29 2018 *)
%o A322158 (PARI) a(n) = for(m=5, oo, if(omega(binomial(m, 5))==n, return(m))) \\ _Felix Fröhlich_, Dec 01 2018
%Y A322158 Cf. A005733, A005735, A321852.
%K A322158 nonn,more
%O A322158 2,1
%A A322158 _Zachary M Franco_, Nov 27 2018
%E A322158 a(22)-a(23) from _Chai Wah Wu_, Dec 29 2018
%E A322158 a(24)-a(28) from _Giovanni Resta_, Jan 04 2019