cp's OEIS Frontend

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.

A115617 Smallest number for which Knuth's power tree method produces an addition chain of length n.

This page as a plain text file.
%I A115617 #26 Apr 24 2025 08:54:03
%S A115617 1,2,3,5,7,11,19,29,47,71,127,191,319,551,1007,1711,2687,4703,8447,
%T A115617 15179,28079,45997,89599,138959,257513,485657,834557,1433501,2854189,
%U A115617 4726127,8814047,15692153,30078877,53574623,94189807,177848059,322928189
%N A115617 Smallest number for which Knuth's power tree method produces an addition chain of length n.
%C A115617 Minimum number in row of power tree A114622. The first 12 terms are identical with A003064.
%C A115617 Smallest k such that A383329(k) = n. - _Pontus von Brömssen_, Apr 24 2025
%Y A115617 Cf. A114622 (the power tree (as defined by Knuth)), A003064 (smallest number with addition chain of length n), A113945 (numbers such that Knuth's power tree method produces a result deficient by 1).
%Y A115617 Indices of records in A383329.
%K A115617 nonn,more
%O A115617 0,2
%A A115617 _Hugo Pfoertner_, Jan 29 2006
%E A115617 a(28)-a(32) from _Hugo Pfoertner_, Sep 05 2015
%E A115617 a(33) from _Hugo Pfoertner_, Oct 01 2015
%E A115617 a(34)-a(36) from _Michael S. Branicky_, Apr 30 2024
%E A115617 a(0) from _Pontus von Brömssen_, Apr 24 2025