Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.
A115614
Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.
Terms
- a(0) =8719a(1) =17438a(2) =28597a(3) =34876a(4) =54359a(5) =56157a(6) =57194a(7) =57293a(8) =59657a(9) =60493a(10) =67171a(11) =69752a(12) =71017a(13) =71065a(14) =75799a(15) =78865a(16) =100987a(17) =108503a(18) =108718a(19) =110361a(20) =112093a(21) =112314a(22) =112679a(23) =113275a(24) =114388a(25) =114586a(26) =115861a(27) =119314a(28) =119417a(29) =120986
External references
- oeis: A115614