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
0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 30, 34, 38, 42, 46, 50, 54, 58, 62, 66, 40, 45, 50, 55, 60, 65, 70, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A230099, A063114, A098736, A230101 are analogs of A092391 and A062028.
LINKS
FORMULA
a(n) = n iff n contains a digit 0 (A011540). - Bernard Schott, Jul 31 2023
MAPLE
with transforms; [seq(n+digprod(n), n=0..200)];
PROG
(Haskell)
a230099 n = a007954 n + n -- Reinhard Zumkeller, Oct 13 2013
(PARI) a(n) = if (n, n + vecprod(digits(n)), 0); \\ Michel Marcus, Dec 18 2018
(Python)
from math import prod
def a(n): return n + prod(map(int, str(n)))
print([a(n) for n in range(78)]) # Michael S. Branicky, Jan 09 2023
CROSSREFS
Sequence in context: A169805 A340479 A263042 * A098727 A182324 A095815
KEYWORD
nonn,base,look
AUTHOR
N. J. A. Sloane, Oct 12 2013
STATUS
approved

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 July 22 12:58 EDT 2024. Contains 374499 sequences. (Running on oeis4.)