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 A271058 #24 Apr 09 2016 16:01:39
%S A271058 1,1,2,2,3,3,3,3,4,4,4,4,6,4,4,4,5,8,9,5,5,5,6,11,5,5,5,6,6,5,5,5,6,6,
%T A271058 6,6,6,6,19,19,6,6,6,6,8,8,6,6,6,6,6,6,26,9,9,6,6,6,29,29,30,6,6,6,7,
%U A271058 8,10,11,34,7,7,7,8,8,37,37,7,7,7,8,9,9,9,7,7,7,8,8
%N A271058 Least m such that n equals a sum of binomial coefficients C(m,k1)+C(m,k2)+C(m,k3)+... with 0<=k1<k2<k3<...<=m.
%H A271058 Giovanni Resta, <a href="/A271058/b271058.txt">Table of n, a(n) for n = 1..2000</a>
%e A271058 a(3) = 2 since 3 = C(2,0) + C(2,1) but 3 != C(1,0) or C(1,1) or C(1,0) + C(1,1).
%t A271058 nn = 22; s = Table[Union@ Map[Total, Binomial[m, #]] &@ Rest@ Subsets@ Range[0, m], {m, nn}]; Table[SelectFirst[Range[If[n == 1, 1, Ceiling@ Log2@ n], nn], MemberQ[s[[#]], n] &], {n, 52}] /. m_ /; MissingQ@ m -> 0 (* _Michael De Vlieger_, Mar 30 2016, Version 10.2, values of m greater than nn show as "0". *)
%K A271058 nonn
%O A271058 1,3
%A A271058 _Logan J. Kleinwaks_, Mar 29 2016