login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230099 a(n) = n + (product of digits of n). 13

%I #31 Jul 31 2023 10:30:25

%S 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 32,35,38,41,44,47,30,34,38,42,46,50,54,58,62,66,40,45,50,55,60,65,70,

%U 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 a(n) = n + (product of digits of n).

%C A230099, A063114, A098736, A230101 are analogs of A092391 and A062028.

%H Reinhard Zumkeller, <a href="/A230099/b230099.txt">Table of n, a(n) for n = 0..10000</a>

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

%F a(n) = n iff n contains a digit 0 (A011540). - _Bernard Schott_, Jul 31 2023

%p with transforms; [seq(n+digprod(n), n=0..200)];

%o (Haskell)

%o a230099 n = a007954 n + n -- _Reinhard Zumkeller_, Oct 13 2013

%o (PARI) a(n) = if (n, n + vecprod(digits(n)), 0); \\ _Michel Marcus_, Dec 18 2018

%o (Python)

%o from math import prod

%o def a(n): return n + prod(map(int, str(n)))

%o print([a(n) for n in range(78)]) # _Michael S. Branicky_, Jan 09 2023

%Y Cf. A007954, A011540, A092391, A062028, A004207, A230093, A003052, A176995.

%Y Cf. also A063114, A098736, A230101, A230103, A230104, A230105, A062028, A230102, A063108.

%K nonn,base,look

%O 0,2

%A _N. J. A. Sloane_, Oct 12 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)