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.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 19, 29, 47, 71, 127, 191, 319, 551, 1007, 1711, 2687, 4703, 8447, 15179, 28079, 45997, 89599, 138959, 257513, 485657, 834557, 1433501, 2854189, 4726127, 8814047, 15692153, 30078877, 53574623, 94189807, 177848059, 322928189
Offset: 0

Views

Author

Hugo Pfoertner, Jan 29 2006

Keywords

Comments

Minimum number in row of power tree A114622. The first 12 terms are identical with A003064.
Smallest k such that A383329(k) = n. - Pontus von Brömssen, Apr 24 2025

Crossrefs

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).
Indices of records in A383329.

Extensions

a(28)-a(32) from Hugo Pfoertner, Sep 05 2015
a(33) from Hugo Pfoertner, Oct 01 2015
a(34)-a(36) from Michael S. Branicky, Apr 30 2024
a(0) from Pontus von Brömssen, Apr 24 2025