|
| |
|
|
A025280
|
|
Complexity of n: number of 1's required to build n using +, * and ^.
|
|
10
| |
|
|
1, 2, 3, 4, 5, 5, 6, 5, 5, 6, 7, 7, 8, 8, 8, 6, 7, 7, 8, 8, 9, 9, 10, 8, 7, 8, 6, 7, 8, 9, 10, 7, 8, 9, 10, 7, 8, 9, 10, 10, 11, 11, 12, 11, 10, 11, 12, 9, 8, 9, 10, 10, 11, 8, 9, 9, 10, 10, 11, 11, 12, 12, 11, 7, 8, 9, 10, 11, 12, 12, 13, 9, 10, 10, 10, 11, 12, 11, 12, 11, 7, 8, 9, 10, 11, 12, 11
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| R. K. Guy, Some suspiciously simple sequences, Amer. Math. Monthly 93 (1986), 186-190; 94 (1987), 965; 96 (1989), 905.
R. K. Guy, Unsolved Problems Number Theory, Sect. F26.
|
|
|
CROSSREFS
| Cf. A003037, A005245, A005520.
A005208(n) + 1.
Sequence in context: A154940 A133344 A091334 * A096365 A200311 A007600
Adjacent sequences: A025277 A025278 A025279 * A025281 A025282 A025283
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), David W. Wilson (davidwwilson(AT)comcast.net)
|
| |
|
|
