The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116463 Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(9*n). 8
 233017, 466034, 699051, 932068, 1165085, 1398102, 1864136, 1878713, 1922393, 2330169, 2330170, 2796203, 2796204, 3262237, 3495255, 3728272, 3757426, 3844786, 3961289, 4660338, 4660340, 5359389, 5592406, 5592408, 5708921, 5941931, 6524474 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The sequence is based on data computed by Neill M. Clift. LINKS Hugo Pfoertner, Table of n, a(n) for n = 1..463 CROSSREFS Cf. A115016, A003313 [l(k)], A086878 [l(k)=l(2*k)], A116459 [l(k)=l(3*k], A261986 [l(k)=l(4*k)], A116460 [l(k)=l(5*k)], A116461 [l(k)=l(6*k)], A116462 [l(k)=l(7*k], A117151 [l(k)=l(10*k)]. Sequence in context: A244349 A128484 A257638 * A015331 A250697 A250682 Adjacent sequences:  A116460 A116461 A116462 * A116464 A116465 A116466 KEYWORD nonn AUTHOR Hugo Pfoertner, Mar 07 2006 EXTENSIONS More terms from 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 25 08:19 EST 2020. Contains 338618 sequences. (Running on oeis4.)