|
%I #6 May 25 2020 06:42:13
%S 77,8719,6475341
%N Smallest number for which Knuth's power tree method produces an addition chain n terms longer than the shortest possible chains for this number.
%C The sequence is based on a table of shortest addition chain lengths computed by _Neill M. Clift_, see link to _Achim Flammenkamp_'s web page given at A003313.
%Y Cf. A114622 [The power tree (as defined by Knuth)], A003313 [Length of shortest addition chain for n], A113945 [numbers such that Knuth's power tree method produces a result deficient by 1], A115614 [numbers such that Knuth's power tree method produces a result deficient by 2], A115615 [numbers such that Knuth's power tree method produces a result deficient by 3].
%K bref,hard,more,nonn
%O 1,1
%A _Hugo Pfoertner_ and _Neill M. Clift_, Feb 15 2006
|
