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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038369 Numbers n such that n = (product of digits of n) * (sum of digits of n). 14
0, 1, 135, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

The list is complete. Proof: One shows that the number of digits is at most 84 and then it is only necessary to consider numbers of the forms 2^i*3^j*7^k and 3^i*5^j*7^k. - David W. Wilson, May 16 2003

LINKS

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

Eric Weisstein's World of Mathematics, Sum-Product Number.

Eric Weisstein's World of Mathematics, Digit.

EXAMPLE

144 belongs to the sequence because 1*4*4=16, 1+4+4=9 -> 16*9=144

MATHEMATICA

pdsdQ[n_]:=Module[{idn=IntegerDigits[n]}, (Total[idn]Times@@idn)==n]; Select[Range[0, 150], pdsdQ]  (* From Harvey P. Dale, Apr 23 2011 *)

CROSSREFS

n = A007953(n) * A007954(n).

Cf. A066282.

Sequence in context: A007251 A219443 A230699 * A066282 A235809 A066176

Adjacent sequences:  A038366 A038367 A038368 * A038370 A038371 A038372

KEYWORD

nice,nonn,fini,base,full

AUTHOR

Felice Russo

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 27 18:17 EST 2014. Contains 250249 sequences.