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 A033893 #18 Jul 31 2025 19:12:57 %S A033893 3,6,12,24,48,96,165,321,444,888,1776,3453,6798,13587,27165,39732, %T A033893 63111,74247,98724,123513,235848,470436,504903,508362,531930,545289, %U A033893 790878,868767,1536555,2892111,4004400,4004844,4049292,4273791,5508570,5564148,7009716 %N A033893 Sort then Add, a(1)=3. %C A033893 a(n+1) is obtained by sorting the digits of a(n) into increasing order then adding this number to a(n). %H A033893 Robert Israel, <a href="/A033893/b033893.txt">Table of n, a(n) for n = 1..10000</a> %e A033893 96 + 69 = 165. %p A033893 A033893 := proc(n) %p A033893 option remember ; %p A033893 if n =1 then %p A033893 3; %p A033893 else %p A033893 A070196(procname(n-1)) ; %p A033893 end if; %p A033893 end proc: %p A033893 seq(A033893(n),n=1..100) ; # _R. J. Mathar_, Feb 03 2025 %Y A033893 Cf. A033860. %K A033893 nonn,base,easy %O A033893 1,1 %A A033893 _N. J. A. Sloane_ and _David W. Wilson_