login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255641 Smallest number requiring n 1's to build using +, * and -. 2
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 (list; graph; refs; listen; history; text; internal format)
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 * A122975 A089597 A022957

Adjacent sequences:  A255638 A255639 A255640 * A255642 A255643 A255644

KEYWORD

nonn

AUTHOR

Janis Iraids, Mar 01 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 17:32 EDT 2019. Contains 328373 sequences. (Running on oeis4.)