A342650 -id:A342650 - cp's OEIS frontend

A342262 Numbers divisible both by the product of their nonzero digits (A055471) and by the sum of their digits (A005349).

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 20, 24, 30, 36, 40, 50, 60, 70, 80, 90, 100, 102, 110, 111, 112, 120, 132, 135, 140, 144, 150, 200, 210, 216, 220, 224, 240, 300, 306, 312, 315, 360, 400, 432, 480, 500, 510, 540, 550, 600, 612, 624, 630, 700, 735, 800, 900, 1000, 1002, 1008

Offset: 1

Bernard Schott, Mar 27 2021

Equivalently, Niven numbers that are divisible by the product of their nonzero digits. A Niven number (A005349) is a number that is divisible by the sum of its digits.
Niven numbers without zero digit that are divisible by the product of their digits are in A038186.
Differs from super Niven numbers, the first 16 terms are the same, then A328273(17) = 48 while a(17) = 50.
This sequence is infinite since if m is a term, then 10*m is another term.

			The product of the nonzero digits of 306 =  3*6 = 18, and 306 divided by 18 = 17. The sum of the digits of 306 = 3 + 0 + 6 = 9, and 306 divided by 9 = 34. Thus 306 is a term.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Intersection of A005349 and A055471.
Supersequence of A038186.
Cf. A051004, A328273, A342650.

q[n_] := And @@ Divisible[n, {Times @@ (d = Select[IntegerDigits[n], # > 0 &]), Plus @@ d}]; Select[Range[1000], q] (* Amiram Eldar, Mar 27 2021 *)
Select[Range[1200],Mod[#,Times@@(IntegerDigits[#]/.(0->1))]== Mod[#,Total[ IntegerDigits[#]]]==0&] (* Harvey P. Dale, Sep 26 2021 *)

isok(m) = my(d=select(x->(x!=0), digits(m))); !(m % vecprod(d)) && !(m % vecsum(d)); \\ Michel Marcus, Mar 27 2021

Example clarified by Harvey P. Dale, Sep 26 2021

A339999 Squares that are divisible by both the sum of their digits and the product of their nonzero digits.

Original entry on oeis.org

1, 4, 9, 36, 100, 144, 400, 900, 1296, 2304, 2916, 3600, 10000, 11664, 12100, 14400, 22500, 32400, 40000, 41616, 82944, 90000, 121104, 122500, 129600, 152100, 176400, 186624, 202500, 219024, 230400, 260100, 291600, 360000, 419904, 435600, 504100

Offset: 1

Michael Gohn, Joshua Harrington, Sophia Lebiere, Hani Samamah, Kyla Shappell, Wing Hong Tony Wong, Jul 23 2021

			For the perfect square 144 = 12^2, the sum of its digits is 9, which divides 144, and the product of its nonzero digits is 16, which also divides 144 so 144 is a term of the sequence.

H. G. Grundman, Sequences of consecutive n-Niven numbers, Fibonacci Quarterly (1994) 32 (2): 174-175.
Jean-Marie De Koninck and Florian Luca, Positive integers divisible by the product of their nonzero digits, Port. Math. 64 (2007) 75-85. (This proof for upper bounds contains an error. See the paper below.)
Jean-Marie De Koninck and Florian Luca, Corrigendum to "Positive integers divisible by the product of their nonzero digits", Portugaliae Math. 64 (2007), 1: 75-85, Port. Math. 74 (2017), 169-170.

Intersection of A000290, A005349 and A055471.

Cf. A118547, A342262, A342650.

Select[Range[720]^2, And @@ Divisible[#, {Plus @@ (d = IntegerDigits[#]), Times @@ Select[d, #1 > 0 &]}] &] (* Amiram Eldar, Jul 23 2021 *)

from math import prod
def sumd(n): return sum(map(int, str(n)))
def nzpd(n): return prod([int(d) for d in str(n) if d != '0'])
def ok(sqr): return sqr > 0 and sqr%sumd(sqr) == 0 and sqr%nzpd(sqr) == 0
print(list(filter(ok, (i*i for i in range(1001)))))
# Michael S. Branicky, Jul 23 2021

cp's OEIS Frontend

A342262 Numbers divisible both by the product of their nonzero digits (A055471) and by the sum of their digits (A005349).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions