Numbers n such that the smallest possible number of multiplications required to compute x^n is by 3 less than the number of multiplications obtained by Knuth's power tree method.
A115615
Numbers n such that the smallest possible number of multiplications required to compute x^n is by 3 less than the number of multiplications obtained by Knuth's power tree method.
Terms
- a(0) =6475341a(1) =13214509a(2) =17900677a(3) =19998021a(4) =25747725a(5) =26429018a(6) =26640937a(7) =27321991a(8) =27404041a(9) =27492775a(10) =27820465a(11) =28475829a(12) =28475875a(13) =28803235a(14) =31947953a(15) =35654893a(16) =35663887a(17) =35801354a(18) =35875087a(19) =38404259a(20) =38860337a(21) =38905477a(22) =39627197a(23) =39995657a(24) =39996042a(25) =40272713a(26) =40468139
External references
- oeis: A115615