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!)
A071985 a(n) is the smallest positive integer that cannot be obtained using at most n-1 of the integers {1, 2, ..., n} using each number at most once and the operators +, -, *, /. 0
1, 3, 7, 17, 47, 158, 681, 3209, 17989, 104289 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For all n>=2, A060315(n+1) > a(n) > A060315(n).

LINKS

Table of n, a(n) for n=1..10.

G. Bannay, LE COMPTE EST BON

Index entries for similar sequences

EXAMPLE

a(3)=7 because using two of the numbers {1,2,3} with the four operations we can obtain 1=1, 2=2, 3=3, 3+1=4, 3+2=5, 3*2=6 but we cannot obtain 7 in the same way.

CROSSREFS

Cf. A060315.

Sequence in context: A320774 A151265 A179944 * A181419 A090977 A014144

Adjacent sequences:  A071982 A071983 A071984 * A071986 A071987 A071988

KEYWORD

hard,more,nonn

AUTHOR

Koksal Karakus (karakusk(AT)hotmail.com), Jun 17 2002

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 16 03:30 EST 2019. Contains 319184 sequences. (Running on oeis4.)