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 2017 22:58:24
%S 2,8,24,64,160,285,203,266,450,538,550,642,566,488,678,958,1120,945,
%T 686,1241,1032,1144,1339,1671,1229,1499,1377,1492,1945,1515,1745,2108,
%U 1650,2326,2110,2106,2558,2105,2049,2548,2590,2247,2786,2750
%N The n-th iteration of (k -> k + sum of base-100 digits of k) applied to n.
%C Main diagonal of square array A(n, k), where A(n, k) gives the result of k applications of the map x -> x + sum of base-100 digits of x, starting at n. - _Felix Fröhlich_, Sep 12 2017
%e n=6: 6+6=12, 12+12=24, 24+24=48, 48+48=96, 96+96=192, 192+92+(0)1=285. After 6 iterations you get 285, so a(6)=285.
%t Table[Nest[# + Total@ IntegerDigits[#, 100] &, n, n], {n, 44}] (* _Michael De Vlieger_, Sep 11 2017 *)
%o (PARI) a(n) = my(x=n); for (k=1, n, x += vecsum(digits(x, 100))); x; \\ _Michel Marcus_, Sep 12 2017
%Y Cf. A286660, A292202.
%K nonn,base
%O 1,1
%A _Peter Weiss_, Sep 11 2017