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

0, 2, 15, 24, 1575, 39366

Offset

1,2

Comments

Except for k = 0, this sequence is a subsequence of A049101. - Jason Yuen, Feb 26 2024

Links

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

Mathematica

Do[ If[ 2n == Apply[ Times, IntegerDigits[n]] Apply[ Plus, IntegerDigits[n]], Print[n]], {n, 0, 10^7} ]

Prog

(PARI) isok(n) = if(n, factorback(digits(n)), 0) * sumdigits(n) == 2*n \\ Mohammed Yaseen, Jul 22 2022
(Python)
from math import prod
def s(n): return sum(map(int, str(n)))
def p(n): return prod(map(int, str(n)))
for n in range(0, 10**6):
  if p(n)*s(n)==2*n:
    print(n) # Mohammed Yaseen, Jul 22 2022

Crossrefs

Cf. A007953, A007954, A049101.

Cf. A038364, A038369, A062237, A066282.

Sequence in context: A153711 A116049 A184236 * A116028 A175828 A300346

Adjacent sequences: A023648 A023649 A023650 * A023652 A023653 A023654

Keyword

nonn,base,fini,full

Author

Jason Earls, Dec 11 2001

Extensions

Offset corrected by Arkadiusz Wesolowski, Oct 17 2012

Status

approved