Integers with a small number of minimal addition chains Original Research Article

For n∈N the number of minimal addition chains, Λ(n), is examined by its representation by reduced graphs. It is shown that Λ(n)=1 implies n=2k or n=3 answering a question of Thurber. Further those n with Λ(n)=2 are characterized.