login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115617 Smallest number for which Knuth's power tree method produces an addition chain of length n. 1

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 00:45 EDT 2024. Contains 374674 sequences. (Running on oeis4.)