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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261986 Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(4*n). 8
 30958077, 55670941, 61487077, 111031197, 112710897, 113180303, 114523591, 121275479, 121963055, 122830789, 215074411, 215182221, 220162873, 222034845, 222254557, 222661789, 223538781, 225298237, 225414385, 225545245, 225695631 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Terms are counterexamples to the conjecture that no shortest addition chains exist such that A003313(m)=A003313(m*2^k) for k>1, with a(1)=30958077 provided in 2008 by Neill M. Clift. LINKS Hugo Pfoertner, Table of n, a(n) for n = 1..75 CROSSREFS Cf. A115016, A003313 [l(k)], A086878 [l(k)=l(2*k)], A116459 [l(k)=l(3*k], A116460 [l(k)=l(5*k)], A116461 [l(k)=l(6*k)], A116462 [l(k)=l(7*k)], A116463 [l(k)=l(9*k], A117151 [l(k)=l(10*k)]. Sequence in context: A252120 A297447 A205272 * A103576 A288087 A203276 Adjacent sequences: A261983 A261984 A261985 * A261987 A261988 A261989 KEYWORD nonn AUTHOR Hugo Pfoertner, Sep 07 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.

Last modified June 2 22:56 EDT 2023. Contains 363102 sequences. (Running on oeis4.)