6475341

Appears in sequences

• 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.at n=0A115615
• Smallest number for which Knuth's power tree method produces an addition chain n terms longer than the shortest possible chains for this number.at n=2A115616