|
Search: id:A142153
|
|
|
| A142153 |
|
a(n) is the "highest smallest" positive integer that cannot be obtained from the (n-1) optimized integers (to be defined for each n) using each number at most once and the operators +, -, *, /. |
|
+0
6
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence is a kind of optimized version of the sequence A060315 for which the inputs are the integers {0,1,...,n-1}. Here the inputs are optimized so that the smallest positive integer, that cannot be obtained, is maximized.
|
|
EXAMPLE
|
a(4)=18 because every integer can be calculated up to 17, using one of the three (!) optimal sequences {2,3,10} or {2,6,11} or {2,6,13}.
a(5)= 87 because every integer can be calculated up to 86, using the optimal numbers {2,3,14,60}.
|
|
CROSSREFS
|
Cf. A141494, A060315.
Sequence in context: A020029 A020119 A109995 this_sequence A094294 A005500 A020025
Adjacent sequences: A142150 A142151 A142152 this_sequence A142154 A142155 A142156
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Gilles A. Fleury (gilles.fleury(AT)supelec.fr), Oct 05 2008
|
|
|
Search completed in 0.002 seconds
|
