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!)
A071313 a(n) is the smallest number that cannot be obtained from the numbers {1,3,...,2*n-1} using each number at most once and the operators +, -, *, /. 0
2, 5, 11, 41, 92, 733, 4337, 28972, 195098 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

G. Bannay, LE COMPTE EST BON

Index entries for similar sequences

EXAMPLE

a(2)=5 because using {1,3} and the four operations we can obtain 1=1, 3-1=2, 3=3, 3+1=4 but we cannot obtain 5 in the same way.

CROSSREFS

Cf. A060315.

Sequence in context: A106886 A237814 A007700 * A172297 A128231 A088148

Adjacent sequences:  A071310 A071311 A071312 * A071314 A071315 A071316

KEYWORD

hard,more,nonn

AUTHOR

Koksal Karakus (karakusk(AT)hotmail.com), Jun 11 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 17 17:23 EST 2019. Contains 319250 sequences. (Running on oeis4.)