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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Sep 12 2024 01:39:50
%S 30958077,55670941,61487077,111031197,112710897,113180303,114523591,
%T 121275479,121963055,122830789,215074411,215182221,220162873,
%U 222034845,222254557,222661789,223538781,225298237,225414385,225545245,225695631
%N Numbers k such that A003313(k) = A003313(4*k).
%C 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_.
%H Hugo Pfoertner, <a href="/A261986/b261986.txt">Table of n, a(n) for n = 1..75</a>
%Y 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)].
%K nonn
%O 1,1
%A _Hugo Pfoertner_, Sep 07 2015