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 A102555 #19 Feb 06 2019 02:33:28
%S A102555 1,2,15,255,3135,41055,440895,10705695,242777535,4360010655
%N A102555 Smallest number covering bitwise exactly n prime factors.
%C A102555 A102550(a(n))=n and A102550(m) < n for m < a(n).
%C A102555 a(10) <= 287901348735. - _Amiram Eldar_, Feb 04 2019
%t A102555 npfQ[k_,n_] := Module[{f=FactorInteger[k][[;;,1]]}, Length[f] == n && Count[ BitAnd[k, f] - f, 0] == n]; s={1}; Do[k=2; While[!npfQ[k,n], k++]; AppendTo[s, k],{n, 1, 7}]; s (* _Amiram Eldar_, Feb 04 2019 *)
%Y A102555 Cf. A007088, A004676, A102550.
%K A102555 nonn,base,more
%O A102555 0,2
%A A102555 _Reinhard Zumkeller_, Jan 14 2005
%E A102555 Two more terms and "base" keyword from _Max Alekseyev_, Sep 13 2009
%E A102555 Offset 0 and a(7)-a(9) from _Amiram Eldar_, Feb 04 2019