|
%I #13 Mar 22 2024 18:49:46
%S 19879,39758,43277,60749,79516,86554,121498,136199,159032,173069,
%T 173108,183929,242996,252941,272398,318064,346138,346216,362861,
%U 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
%N Numbers k such that the factor method (A064097) for computing the k-th power has fewer multiplications than Knuth's power tree method (A114622).
%H Hugo Pfoertner, <a href="/A003313/a003313.txt">Addition chains</a>.
%H V. Zhuravlev, P. Samovol, <a href="http://kvant.mccme.ru/pdf/2013/2013-02.pdf">Faster than the fastest, or can one beat the binary algorithm</a>, Kvant 2 (2013), 7-15. (in Russian)
%Y Cf. A003313, A064097, A114622, A230528.
%K nonn
%O 1,1
%A _Max Alekseyev_ at the suggestion of _Hugo Pfoertner_, Apr 06 2015
|
