login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055931 Product of the digits of n divides the sum of the digits of n. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 111, 112, 121, 123, 132, 211, 213, 231, 312, 321, 1111, 1113, 1124, 1131, 1142, 1214, 1241, 1311, 1412, 1421, 2114, 2141, 2411, 3111, 4112, 4121, 4211, 11111, 11112, 11114, 11121, 11125, 11133, 11141, 11152, 11211, 11215 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..48.

MATHEMATICA

Do[If[Mod[Apply[Plus, IntegerDigits[n]], Apply[Times, IntegerDigits[n]]]==0, Print[n]], {n, 1, 100000}]

pdsQ[n_]:=Module[{idn=IntegerDigits[n]}, !MemberQ[idn, 0] && Divisible[ Total[idn], Times@@idn]]; Select[Range[12000], pdsQ] (* Harvey P. Dale, Dec 07 2011 *)

CROSSREFS

Cf. A038367.

Sequence in context: A201060 A201064 A103357 * A250411 A250410 A250409

Adjacent sequences:  A055928 A055929 A055930 * A055932 A055933 A055934

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 18:37 EST 2019. Contains 329865 sequences. (Running on oeis4.)