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 A255641 #13 Mar 23 2015 15:14:36 %S A255641 1,2,3,4,5,7,10,11,17,22,29,41,58,67,101,131,173,262,346,461,617,787, %T A255641 1123,1571,2077,2767,4153,5443,7963,10733,13997,21101,27997,36643, %U A255641 49747,72103,99317,143239,179107,260213 %N A255641 Smallest number requiring n 1's to build using +, * and -. %C A255641 Until n = 10 the terms are equal to A005520(n) where subtraction is not allowed. %H A255641 Janis Iraids, <a href="/A255641/b255641.txt">Table of n, a(n) for n = 1..81</a> %H A255641 Juris Čerņenoks, Jānis Iraids, Mārtiņš Opmanis, Rihards Opmanis, and Kārlis Podnieks, <a href="http://arxiv.org/abs/1409.0446">Integer Complexity: Experimental and Analytical Results II</a>, arXiv:1409.0446 [math.NT], 2014. %H A255641 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %e A255641 a(11) = 29, because 23 = (1+1)*(1+1)*(1+1)*(1+1+1)-1, but 29 = ((1+1+1)*(1+1)+1)*(1+1)*(1+1)+1. %Y A255641 Least inverse (or records) of A091333. %Y A255641 Cf. A005520, A005245, A173419. %K A255641 nonn %O A255641 1,2 %A A255641 _Janis Iraids_, Mar 01 2015