The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055933 Product of digits (not counting zeros) of n divides sum of digits of n. 1
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 22, 30, 40, 50, 60, 70, 80, 90, 100, 101, 110, 111, 112, 121, 123, 132, 200, 202, 211, 213, 220, 231, 300, 312, 321, 400, 500, 600, 700, 800, 900, 1000, 1001, 1010, 1011, 1012, 1021, 1023, 1032, 1100, 1101, 1102, 1110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA Do[a=IntegerDigits[FromDigits[Sort[IntegerDigits[n]]]]; If[Mod[Apply[Plus, a], Apply[Times, a]]==0, Print[n]], {n, 5000}] pdsdQ[n_]:=Module[{idnz=Select[IntegerDigits[n], #!=0&]}, Divisible[Total[ idnz], Times@@idnz]]; Select[Range[1200], pdsdQ] (* Harvey P. Dale, Aug 13 2015 *) CROSSREFS Sequence in context: A193460 A114801 A114802 * A188650 A132578 A101318 Adjacent sequences:  A055930 A055931 A055932 * A055934 A055935 A055936 KEYWORD easy,nonn,base AUTHOR Robert G. Wilson v, Jul 17 2000 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 May 7 03:48 EDT 2021. Contains 343636 sequences. (Running on oeis4.)