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 A090335 #9 Dec 16 2021 07:37:45
%S A090335 1,2,33,2093,239723,29918977,17597346187,17155385292853,
%T A090335 10633323942990239,15790705299133143889
%N A090335 Smallest number with exactly n distinct prime factors such that in binary representation the divisors >1 form a prefix code.
%C A090335 Conjecture: the sequence is defined for all n.
%C A090335 a(10) <= 281594003343201014885689. - _David Wasserman_, Dec 13 2005
%F A090335 a(n) = Min{k: A090330(k)=0 and A001221(k)=n}.
%e A090335 a(3) = 2093 = 7*13*23 with divisors >1: 7, 13, 23, 91, 161, 299 and 2093, which are prefix-free in binary: 111, 1101, 10111, 1011011, 10100001, 100101011 and 100000101101.
%Y A090335 Cf. A088862, A090332.
%K A090335 nonn,base,more
%O A090335 1,2
%A A090335 _Reinhard Zumkeller_, Nov 26 2003
%E A090335 More terms from _David Wasserman_, Dec 13 2005