Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071314
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071314 a(n) is the smallest number that cannot be obtained from the numbers {2^0,2^1,...,2^n} using each number at most once and the operators +, -, *, /. +0
1
2, 4, 11, 27, 77, 595, 2471, 9643, 19351 (list; graph; listen)
OFFSET

0,1

LINKS

G. Bannay, LE COMPTE EST BON

Index entries for similar sequences

EXAMPLE

a(2)=11 because using {1,2,4} and the four operations we can obtain all the numbers up to 10, for example 10=(4+1)*2, but we cannot obtain 11 in the same way.

CROSSREFS

Cf. A060315.

Adjacent sequences: A071311 A071312 A071313 this_sequence A071315 A071316 A071317

Sequence in context: A123432 A090899 A123440 this_sequence A123441 A086441 A131482

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research