A256653 Numbers k such that the factor method (A064097) for computing the k-th power has fewer multiplications than Knuth's power tree method (A114622).

19879, 39758, 43277, 60749, 79516, 86554, 121498, 136199, 159032, 173069, 173108, 183929, 242996, 252941, 272398, 318064, 346138, 346216, 362861, 367757, 367858, 453281, 456017, 485992, 505882, 544796, 561727, 579193, 603167, 636128, 637969, 692276, 692432, 725722, 735514, 735709, 735716, 772193, 906562, 912034, 931297, 963649, 971984, 1011764, 1051727

Offset

1,1

Links

Table of n, a(n) for n=1..45.

Hugo Pfoertner, Addition chains.

V. Zhuravlev, P. Samovol, Faster than the fastest, or can one beat the binary algorithm, Kvant 2 (2013), 7-15. (in Russian)

Crossrefs

Cf. A003313, A064097, A114622, A230528.

Sequence in context: A236497 A194197 A250703 * A186957 A236907 A263298

Adjacent sequences: A256650 A256651 A256652 * A256654 A256655 A256656

Keyword

nonn

Author

Max Alekseyev at the suggestion of Hugo Pfoertner, Apr 06 2015

Status

approved