login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071819 a(n) is the difference between the two smallest positive integers that you cannot obtain using the integers {1,2,...,n} at most once and the four operators +, -, *, /. 0
1, 1, 1, 2, 3, 23, 5, 144, 98, 658 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Gilles Bannay, Countdown Problem
EXAMPLE
a(4)=2 because 29 and 31 are the smallest numbers that you cannot obtain using {1,2,3,4} and the four operations and 31-29 = 2.
CROSSREFS
Cf. A060315.
Sequence in context: A114101 A114007 A282795 * A329916 A085946 A280894
KEYWORD
hard,more,nonn
AUTHOR
Koksal Karakus (karakusk(AT)hotmail.com), Jun 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 21:32 EDT 2024. Contains 372257 sequences. (Running on oeis4.)