This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A115616 #6 May 25 2020 06:42:13 %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 _Neill M. Clift_, see link to _Achim 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]. %K A115616 bref,hard,more,nonn %O A115616 1,1 %A A115616 _Hugo Pfoertner_ and _Neill M. Clift_, Feb 15 2006