This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038364 Numbers n such that n = (product of digits of n) + (sum of digits of n). 0
 0, 19, 29, 39, 49, 59, 69, 79, 89, 99 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A number n with m digits belongs to the sequence if K1*K2*K3*...*Km-9_(m-1)*K1-9_(m-2)*K2....=0 where Ki are the digits of n and 9_(m-1) is a repdigit with 9 repeated (m-1) times. Hence m=2, so sequence is complete. LINKS MAPLE select(proc(t) local d; d:= convert(t, base, 10); convert(d, `+`)+convert(d, `*`)=t end proc, [\$0..100]); # Robert Israel, Dec 16 2014 MATHEMATICA Select[Range[100], # == Times @@ IntegerDigits[#] + Plus @@ IntegerDigits[#] &] (* Michael De Vlieger, Dec 26 2014 *) PROG (PARI) isok(n) = my(d=digits(n)); n == (sum(i=1, #d, d[i]) + prod(i=1, #d, d[i])); \\ Michel Marcus, Apr 06 2014 CROSSREFS Sequence in context: A061763 A088474 A087097 * A151360 A109276 A133765 Adjacent sequences:  A038361 A038362 A038363 * A038365 A038366 A038367 KEYWORD fini,nonn,base,full AUTHOR STATUS approved

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

Last modified July 17 16:58 EDT 2019. Contains 325107 sequences. (Running on oeis4.)