The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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
Sequence in context: A236497 A194197 A250703 * A186957 A236907 A263298
KEYWORD
nonn
AUTHOR
Max Alekseyev at the suggestion of Hugo Pfoertner, Apr 06 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 22:02 EDT 2024. Contains 372765 sequences. (Running on oeis4.)