%I #13 Mar 23 2015 15:14:36

%S 1,2,3,4,5,7,10,11,17,22,29,41,58,67,101,131,173,262,346,461,617,787,

%T 1123,1571,2077,2767,4153,5443,7963,10733,13997,21101,27997,36643,

%U 49747,72103,99317,143239,179107,260213

%N Smallest number requiring n 1's to build using +, * and -.

%C Until n = 10 the terms are equal to A005520(n) where subtraction is not allowed.

%H Janis Iraids, <a href="/A255641/b255641.txt">Table of n, a(n) for n = 1..81</a>

%H 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 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>

%e 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 Least inverse (or records) of A091333.

%Y Cf. A005520, A005245, A173419.

%K nonn

%O 1,2

%A _Janis Iraids_, Mar 01 2015