login
Sort then Add, a(1) =9.
2

%I #17 Feb 03 2025 05:37:56

%S 9,18,36,72,99,198,387,765,1332,2565,5121,6246,8712,9990,10989,12888,

%T 25776,51453,64908,69597,126396,250065,252621,374877,722655,948222,

%U 1170711,1281888,2410776,2535453,4870008,4874796,9342585,11688174,22834962,45069651

%N Sort then Add, a(1) =9.

%H Harvey P. Dale, <a href="/A033896/b033896.txt">Table of n, a(n) for n = 1..1000</a>

%p A033896 := proc(n)

%p option remember ;

%p if n =1 then

%p 9;

%p else

%p A070196(procname(n-1)) ;

%p end if;

%p end proc:

%p seq(A033896(n),n=1..100) ; # _R. J. Mathar_, Feb 03 2025

%t NestList[FromDigits[Sort[IntegerDigits[#]]]+#&,9,40] (* _Harvey P. Dale_, Aug 19 2014 *)

%o (Python)

%o from itertools import accumulate

%o def sta(anm1, _): return anm1 + int("".join(sorted(str(anm1))))

%o print(list(accumulate([9]*36, sta))) # _Michael S. Branicky_, Sep 18 2021

%Y Cf. A033860, A066711.

%K nonn,base,easy

%O 1,1

%A _N. J. A. Sloane_, _David W. Wilson_