Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055931
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055931 Product of the digits of n divides the sum of the digits of n. +0
3
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; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A038367.

Sequence in context: A082207 A083115 A103357 this_sequence A064704 A083136 A117057

Adjacent sequences: A055928 A055929 A055930 this_sequence A055932 A055933 A055934

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 17 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research