|
Search: id:A008057
|
|
|
| A008057 |
|
Smallest sum of an addition chain for 2n+1. |
|
+0
2
|
|
| 0, 5, 10, 16, 20, 27, 31, 35, 40, 47, 51, 56, 60, 65, 74, 78, 80, 86, 92, 96, 102, 106, 110, 120, 121, 125, 134, 137, 142, 148
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
H. Zantema, Minimizing sums of addition chains, J. Algorithms, 12 (1991), 281-307.
|
|
CROSSREFS
|
Cf. A003313, A079300, A003065, A005766.
Sequence in context: A044830 A033002 A037358 this_sequence A075003 A005280 A052905
Adjacent sequences: A008054 A008055 A008056 this_sequence A008058 A008059 A008060
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Aug 07 2003
|
|
|
Search completed in 0.002 seconds
|
