|
Search: id:A116461
|
|
|
| A116461 |
|
Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(6*n). |
|
+0
8
|
|
| 2731, 5462, 10923, 10924, 13655, 21846, 21848, 27307, 27310, 43691, 43692, 43696, 54614, 54615, 54620, 71003, 87382, 87384, 87392, 92843, 109227, 109228, 109230, 109240, 133819, 142006, 152919, 174763, 174764, 174768, 174784, 177515, 185686
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The first 20 terms are identical to those given in Table 4.5, "The set of values m satisfying l(3m)<l(m)" on page 61 of Daniel Bleichenbachers PhD Thesis (see A104699). Only 109227 is not in Table 4.5.
|
|
LINKS
|
Daniel Bleichenbacher, Efficiency and Security of Cryptosystems based on Number Theory. PhD Thesis, Diss. ETH No. 11404, Zuerich 1996. See p. 61.
|
|
CROSSREFS
|
Cf. A115016, A003313 [l(k)], A086878 [l(k)=l(2*k)], A116459 [l(k)=l(3*k], A116460 [l(k)=l(5*k)], A116462 [l(k)=l(7*k)], A116463 [l(k)=l(9*k], A117151 [l(k)=l(10*k)].
Cf. A104699.
Sequence in context: A043579 A068305 A031812 this_sequence A104699 A076575 A015423
Adjacent sequences: A116458 A116459 A116460 this_sequence A116462 A116463 A116464
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 07 2006
|
|
|
Search completed in 0.002 seconds
|
