|
Search: id:A099053
|
|
|
| A099053 |
|
a(n) is the smallest number of digits that are needed to construct n using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits. No subexpression can have value <= 0. |
|
+0
7
|
|
| 1, 1, 2, 2, 3, 3, 4, 3, 3, 4, 4, 4, 5, 4, 4, 3, 4, 4, 5, 5, 6, 5, 5, 5, 4, 5, 4, 5, 5, 5, 5, 4, 5, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Yet another definition of the complexity of a number.
|
|
EXAMPLE
|
1 = 1, so has complexity 1.
2 = 2, so has complexity 1.
3 = 1+2, so has complexity 2.
4 = 2+2 = 2*2 = 2^2, so has complexity 2.
5 = 2+1+2, so has complexity 3.
...
16 = 2^2^2, so has complexity 3.
|
|
CROSSREFS
|
Positions of records are given in A060274.
Sequence in context: A031268 A045430 A067693 this_sequence A075167 A057935 A124831
Adjacent sequences: A099050 A099051 A099052 this_sequence A099054 A099055 A099056
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Tim Peters (tim.one(AT)comcast.net), Nov 14 2004
|
|
|
Search completed in 0.002 seconds
|
