cp's OEIS Frontend

A230099 a(n) = n + (product of digits of n).

%I A230099 #31 Jul 31 2023 10:30:25
%S A230099 0,2,4,6,8,10,12,14,16,18,10,12,14,16,18,20,22,24,26,28,20,23,26,29,
%T A230099 32,35,38,41,44,47,30,34,38,42,46,50,54,58,62,66,40,45,50,55,60,65,70,
%U A230099 75,80,85,50,56,62,68,74,80,86,92,98,104,60,67,74,81,88,95,102,109,116,123,70,78,86,94,102,110,118,126
%N A230099 a(n) = n + (product of digits of n).
%C A230099 A230099, A063114, A098736, A230101 are analogs of A092391 and A062028.
%H A230099 Reinhard Zumkeller, <a href="/A230099/b230099.txt">Table of n, a(n) for n = 0..10000</a>
%H A230099 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%F A230099 a(n) = n iff n contains a digit 0 (A011540). - _Bernard Schott_, Jul 31 2023
%p A230099 with transforms; [seq(n+digprod(n), n=0..200)];
%o A230099 (Haskell)
%o A230099 a230099 n = a007954 n + n  -- _Reinhard Zumkeller_, Oct 13 2013
%o A230099 (PARI) a(n) = if (n, n + vecprod(digits(n)), 0); \\ _Michel Marcus_, Dec 18 2018
%o A230099 (Python)
%o A230099 from math import prod
%o A230099 def a(n): return n + prod(map(int, str(n)))
%o A230099 print([a(n) for n in range(78)]) # _Michael S. Branicky_, Jan 09 2023
%Y A230099 Cf. A007954, A011540, A092391, A062028, A004207, A230093, A003052, A176995.
%Y A230099 Cf. also A063114, A098736, A230101, A230103, A230104, A230105, A062028, A230102, A063108.
%K A230099 nonn,base,look
%O A230099 0,2
%A A230099 _N. J. A. Sloane_, Oct 12 2013