Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071819
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 2, 3, 23, 5, 144, 98, 658 (list; graph; listen)
OFFSET

1,4

LINKS

G. Bannay, LE COMPTE EST BON

Index entries for similar sequences

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: A130846 A114101 A114007 this_sequence A085946 A042585 A143279

Adjacent sequences: A071816 A071817 A071818 this_sequence A071820 A071821 A071822

KEYWORD

hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research