%I #28 Aug 18 2024 05:13:01

%S 2,4,6,8,10,12,14,16,18,11,12,14,16,18,20,22,24,26,28,22,23,26,29,32,

%T 35,38,41,44,47,33,34,38,42,46,50,54,58,62,66,44,45,50,55,60,65,70,75,

%U 80,85,55,56,62,68,74,80,86,92,98,104,66,67,74,81,88,95,102,109,116

%N n + product of nonzero digits of n.

%H Harry J. Smith, <a href="/A063114/b063114.txt">Table of n, a(n) for n = 1..1000</a>

%H P. A. Loomis, <a href="http://facstaff.bloomu.edu/ploomis/sequences.html">An Interesting Family of Iterated Sequences</a>

%H P. A. Loomis, <a href="http://facstaff.bloomu.edu/ploomis/itseq4.ps">An Introduction to Digit Product Sequences</a>, J. Rec. Math., 32 (2003-2004), 147-151.

%H P. A. Loomis, <a href="/A063108/a063108.pdf">An Introduction to Digit Product Sequences</a>, J. Rec. Math., 32 (2003-2004), 147-151. [Annotated archived copy]

%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>

%F a(n) = n + A051801(n). - _Reinhard Zumkeller_, Jan 15 2012

%e a(59) = 59 + 5*9 = 104. a(66) = 66 + 6*6 = 102.

%t Table[i+Times@@(IntegerDigits[i]/. 0->1), {i, 70}]

%o (ARIBAS): var stk: stack; end; for n := 1 to 80 do s := itoa(n); for j := 0 to length(s) -1 do k := atoi(s[j..j]); if k > 0 then stack_push(stk,k); end; end; write(n + product(stack2array(stk))," "); end;

%o (PARI)

%o ProdNzD(x)= local(d,p); p=1; while (x>9, d=x-10*(x\10); if (d, p*=d); x\=10); return(p*x)

%o for (n=1, 1000, write("b063114.txt", n, " ", n + ProdNzD(n)) ) \\ _Harry J. Smith_, Aug 19 2009

%o (Haskell)

%o a063114 n = n + a051801 n -- _Reinhard Zumkeller_, Jan 15 2012

%Y Cf. A063108, A063112, A063113, A063543.

%K nonn,easy,base,look

%O 1,1

%A _N. J. A. Sloane_, Aug 08 2001

%E More terms from _Robert G. Wilson v_ and _Klaus Brockhaus_, Aug 09 2001