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!)
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. 3
77, 8719, 6475341 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..3.

CROSSREFS

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].

Sequence in context: A107787 A099638 A046191 * A226256 A120799 A266054

Adjacent sequences:  A115613 A115614 A115615 * A115617 A115618 A115619

KEYWORD

bref,hard,more,nonn

AUTHOR

Hugo Pfoertner and Neill M. Clift, Feb 15 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 29 05:09 EST 2022. Contains 350672 sequences. (Running on oeis4.)