Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066282
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066282 n = (product of nonzero digits of n) * (sum of digits of n). +0
2
0, 1, 135, 144, 1088 (list; graph; listen)
OFFSET

0,3

COMMENT

No further term below 5*10^7. The sequence can be shown to be finite by a slight modification of D. Wilson's proof of the finiteness of A038369.

EXAMPLE

(1+0+8+8) * (1*8*8) = 17*64 = 1088, so 1088 belongs to the sequence.

MATHEMATICA

Do[ d = Sort[ IntegerDigits[n]]; While[ First[d] == 0, d = Drop[d, 1]]; If[n == Apply[ Plus, d] Apply[ Times, d], Print[n]], {n, 0, 5*10^7} ]

PROGRAM

(ARIBAS): function a066282(a, b: integer); var n, k, j, p, d: integer; s: string; begin for n := a to b do s := itoa(n); k := 0; p := 1; for j := 0 to length(s) - 1 do d := atoi(s[j..j]); k := k + d; if d > 0 then p := p*d; end; end; if n = p*k then write(n, ", "); end; end; end; a066282(0, 25000). (PARI): a066282(a, b) = local(n, k, q, p, d); for(n=a, b, k=0; p=1; q=n; while(q>0, d=divrem(q, 10); q=d[1]; k=k+d[2]; p=p*max(1, d[2])); if(n==p*k, print1(n, ", "))) a066282(0, 25000)

CROSSREFS

Cf. A038369.

Sequence in context: A051387 A007251 A038369 this_sequence A066176 A025363 A096593

Adjacent sequences: A066279 A066280 A066281 this_sequence A066283 A066284 A066285

KEYWORD

base,nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 13 2001

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 August 8 15:51 EDT 2008. Contains 142751 sequences.


AT&T Labs Research