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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253723 Length of shortest addition chain corresponding to maximum of A003313(k)/log_2(k) in interval 2^n < k < 2^(n+1). 1
2, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The values of k, for which the maximum values are obtained, are given in A264803.

LINKS

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

CROSSREFS

Cf. A003313, A264803.

Sequence in context: A010423 A035235 A354482 * A014132 A184008 A183862

Adjacent sequences: A253720 A253721 A253722 * A253724 A253725 A253726

KEYWORD

nonn,more

AUTHOR

Hugo Pfoertner, Dec 18 2015

STATUS

approved

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 December 6 18:58 EST 2022. Contains 358644 sequences. (Running on oeis4.)