cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A038369 Numbers k such that k = (product of digits of k) * (sum of digits of k).

Original entry on oeis.org

0, 1, 135, 144
Offset: 1

Views

Author

Keywords

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

Examples

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

Crossrefs

Programs

  • Mathematica
    pdsdQ[n_]:=Module[{idn=IntegerDigits[n]},(Total[idn]Times@@idn)==n]; Select[Range[0,150],pdsdQ]  (* Harvey P. Dale, Apr 23 2011 *)
  • PARI
    is(n)=my(d=digits(n)); factorback(d)*vecsum(d)==n \\ Charles R Greathouse IV, Feb 06 2017

Formula

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