Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
2, 5, 11, 41, 92, 733, 4337, 28972, 195098 (list; graph; listen)
OFFSET

1,1

LINKS

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: A065850 A106886 A007700 this_sequence A128231 A121981 A088148

Adjacent sequences: A071310 A071311 A071312 this_sequence A071314 A071315 A071316

KEYWORD

hard,more,nonn

AUTHOR

Koksal Karakus (karakusk(AT)hotmail.com), Jun 11 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research