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

1, 2, 3, 4, 5, 7, 10, 11, 17, 22, 29, 41, 58, 67, 101, 131, 173, 262, 346, 461, 617, 787, 1123, 1571, 2077, 2767, 4153, 5443, 7963, 10733, 13997, 21101, 27997, 36643, 49747, 72103, 99317, 143239, 179107, 260213

Offset

1,2

Comments

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

Links

Janis Iraids, Table of n, a(n) for n = 1..81

Juris Čerņenoks, Jānis Iraids, Mārtiņš Opmanis, Rihards Opmanis, and Kārlis Podnieks, Integer Complexity: Experimental and Analytical Results II, arXiv:1409.0446 [math.NT], 2014.

Index to sequences related to the complexity of n

Example

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.

Crossrefs

Least inverse (or records) of A091333.

Cf. A005520, A005245, A173419.

Sequence in context: A182061 A005520 A048183 * A365093 A122975 A089597

Adjacent sequences: A255638 A255639 A255640 * A255642 A255643 A255644

Keyword

nonn

Author

Janis Iraids, Mar 01 2015

Status

approved