|
%I #20 Sep 11 2019 20:26:24
%S 1,3,9,27,50,55,90,99,198,288,434,493,617,673,815,869,1324,1358,1495,
%T 1694,1930,1943,2068,2084,2098,2117,2142,2167,2267,2452,2545,2761,
%U 2861,2974,3500,3508,3524,3658,4400,4408,4424,4566,5307,5322,5394,5955,7104,7116
%N a(1) = 1; a(n+1) = a(n) + product of digits of a(n) + sum of digits of a(n).
%C Unlike A063108, this sequence includes in its formula the digit 0 in the product of digits of a(n).
%H Robert Israel, <a href="/A248078/b248078.txt">Table of n, a(n) for n = 1..10000</a>
%e Given a(5)=50, then a(6)=50+(5+0)+(5*0)=55.
%p f:= proc(x) local L;
%p L:= convert(x,base,10);
%p x + convert(L,`+`)+convert(L,`*`)
%p end proc:
%p A[1]:= 1:
%p for n from 2 to 100 do A[n]:= f(A[n-1]) od:
%p seq(A[i],i=1..100); # _Robert Israel_, Jun 25 2019
%t NestList[#+Total[IntegerDigits[#]]+Times@@IntegerDigits[#]&,1,50] (* _Harvey P. Dale_, Sep 11 2019 *)
%o (PARI) lista(nn) = {prev = 1; print1(prev, ", "); for (n=1, nn, d = digits(prev); prev += sumdigits(prev) + prod(k=1, #d, d[k]); print1(prev, ", "););} \\ _Michel Marcus_, Oct 01 2014
%Y Cf. A063108, A004207.
%K nonn,base,easy,look
%O 1,2
%A _Gil Broussard_, Sep 30 2014
|
