|
%I #12 Sep 11 2019 22:48:00
%S 1,3,5,7,13,41,113,311,1821,10267,74587,1015453,12550793
%N Least k for which A140361(n) = k.
%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%e a(1) = 3: 3 can be written as 2+1, requiring 1 operation
%e a(2) = 5: 5 = (2+1)+2, the lowest number requiring 2 operations
%e a(3) = 7: ((2+2)+1)+2, the lowest number requiring 3 operations
%e a(4) = 13: (2+1)*3+2+2 (Note: 3 = 2+1 reused)
%e a(5) = 41: (2+1)*2*6+3+2 (3 = 2+1 reused, 6 = 3*2 reused)
%e a(6) = 113: ((2+1)*3+3+1)*9-4
%e a(7) = 311: ((2+1)*3*3+1)*(9+2)+3
%e a(8) = 1821: (2+(2+1))*(3+(2+2)*4)*19+16
%e a(9) = 10267: (1+(2+(2+1))*(3*3))*(5*45-2)+9
%e a(10) = 74587: (2+1)*(((2*(3*3)*9-2)-3)*157+160)+160
%Y Cf. A217032.
%K hard,more,nonn
%O 0,2
%A _Leonid Broukhis_, Aug 04 2008
%E Comment removed and three new entries added by Jeffrey Wang (jeffreyw(AT)stanford.edu), Oct 10 2009
%E a(11)-a(12) from _Gil Dogon_, Apr 25 2013
| 