Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Apr 30 2024 11:41:01
%S 2,3,5,7,11,19,29,47,71,127,191,319,551,1007,1711,2687,4703,8447,
%T 15179,28079,45997,89599,138959,257513,485657,834557,1433501,2854189,
%U 4726127,8814047,15692153,30078877,53574623,94189807,177848059,322928189
%N Smallest number for which Knuth's power tree method produces an addition chain of length n.
%C Minimum number in row of power tree A114622. The first 11 terms are identical with A003064.
%Y 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].
%K nonn,more
%O 1,1
%A _Hugo Pfoertner_, Jan 29 2006
%E a(28)-a(32) from _Hugo Pfoertner_, Sep 05 2015
%E a(33) from _Hugo Pfoertner_, Oct 01 2015
%E a(34)-a(36) from _Michael S. Branicky_, Apr 30 2024