This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A117463 #14 Apr 21 2024 11:38:56 %S A117463 2,4,6,8,10,12,14,16,18,16,16,12,16,20,24,28,32,18,20,32,24,32,40,24, %T A117463 28,32,36,40,44,48,32,40,48,56,64,36,40,44,48,64,80,48,56,64,72,80,88, %U A117463 48,52,80,96,56,64,72,80,88,96,104,112,96,112,64,72,80,88,96,104,112,120,112,128 %N A117463 Result of the final iteration of doubling in A117462 to equal or exceed n. %F A117463 a(n) = 2^A117462(n) * A007953(n). - _R. J. Mathar_, Sep 25 2018 %e A117463 In a(11) = 16: SOD(11) = 2. 2 doubled is 4,8,16, after A117462(11)= 3 iterations. %p A117463 A117463 := proc(n) %p A117463 2^A117462(n)*digsum(n) ; %p A117463 end proc: %p A117463 seq(A117463(n),n=1..90) ; # _R. J. Mathar_, Sep 25 2018 %o A117463 (UBASIC) %o A117463 10 'use of str,mid,len,val 20 'number of doubled iterations required to equal or exceed sod(n) %o A117463 30 C=C+1 %o A117463 40 D=str(C) %o A117463 50 E=len(D) %o A117463 60 for Q=2 to E %o A117463 70 A=mid(D,Q,1):G=val(A) %o A117463 80 I=I+G %o A117463 90 next Q %o A117463 100 print C;I;"-"; %o A117463 110 K=I %o A117463 120 I=0 %o A117463 130 for R=1 to C %o A117463 140 K=K+K:T=T+1 %o A117463 150 if K>=C then print C;K;T:cancel for:stop:goto 170 %o A117463 160 next R %o A117463 170 K=0:T=0 %o A117463 180 goto 30 %Y A117463 Cf. A117462, A169805. %K A117463 easy,nonn,base,less %O A117463 0,1 %A A117463 _Enoch Haga_, Mar 18 2006 %E A117463 Extended by _R. J. Mathar_, Sep 25 2018