%I A115616
%S A115616 77,8719,6475341
%N A115616 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 A115616 The sequence is based on a table of shortest addition chain lengths computed 
               by N. Clift (neillclift(AT)msn.com), see link to A. Flammenkamp's 
               web page given at A003313.
%Y A115616 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].
%Y A115616 Sequence in context: A107787 A099638 A046191 this_sequence A120799 A098024 
               A117330
%Y A115616 Adjacent sequences: A115613 A115614 A115615 this_sequence A115617 A115618 
               A115619
%K A115616 bref,hard,more,nonn
%O A115616 1,1
%A A115616 Hugo Pfoertner (hugo(AT)pfoertner.org) and N. Clift (neillclift(AT)msn.com), 
               Feb 15 2006