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 A192101 #8 Mar 31 2012 10:27:21
%S A192101 1,2,5,20,83,594,2641,10856,43623,305766,1354341,5548644,22325859,
%T A192101 89434722,357870241,1431612752,5726580047
%N A192101 Least number requiring n terms to express it as a sum of signed terms of the form 2^k-1.
%C A192101 a(n) = min{ i : A192099(i) = n }
%C A192101 Conjecture: a(n) = (4^n)/3 + O(1).
%H A192101 <a href="http://www.crm.umontreal.ca/CanaDAM2009/pdf/ruskey.pdf">Isoperimetric sequences for infinite complete binary trees and their relation to meta-Fibonacci sequences and signed almost binary partitions</a>, talk at CANADAM, 2009.
%e A192101 The smallest value of i for which A192099(i) = 5 is 83 = 31+15+7-3+1, and so a(5) = 83.
%Y A192101 Cf. A192099.
%K A192101 nonn,more
%O A192101 1,2
%A A192101 _Frank Ruskey_, Jul 29 2011