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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048183 Least inverse of A048182. 2
2, 3, 4, 5, 7, 10, 11, 17, 22, 29, 41, 58, 67, 101, 131, 173, 259, 346, 461, 617, 787, 1037, 1571, 2074, 2767, 3703, 5357, 7403, 9427, 12443, 16663, 22217, 33323, 44437, 63677, 88843, 113117, 149323, 219803, 298597, 399883, 533237, 771403, 1018483 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Also a(n) is the smallest integer that cannot be obtained by using the number 1 at most n+1 times and the operators +, -, *, /. - Koksal Karakus (karakusk(AT)hotmail.com), May 27 2002

LINKS

Table of n, a(n) for n=0..43.

Juris Cernenoks, Janis Iraids, Martins Opmanis, Rihards Opmanis, Karlis Podnieks, Integer Complexity: Experimental and Analytical Results II, arxiv:1409.0446, 2014; see Table 2.

Index entries for similar sequences

EXAMPLE

a(4)=7 because by using the number 1 at most five times we can write 1=1, 1+1=2, 1+1+1=3, 1+1+1+1+1=5, (1+1)*(1+1+1)=6 but we cannot obtain 7 in the same way.

CROSSREFS

Cf. A005520, A060315, A181898.

Sequence in context: A265938 A182061 A005520 * A255641 A122975 A089597

Adjacent sequences:  A048180 A048181 A048182 * A048184 A048185 A048186

KEYWORD

nonn

AUTHOR

David W. Wilson

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 January 18 11:21 EST 2019. Contains 319271 sequences. (Running on oeis4.)