A055471 -id:A055471 - cp's OEIS frontend

A066355 A055471(n)/(product of nonzero digits of A055471(n)).

1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 11, 6, 3, 10, 3, 10, 2, 10, 10, 10, 10, 10, 10, 100, 101, 51, 26, 21, 110, 111, 56, 23, 60, 8, 22, 9, 35, 9, 30, 5, 100, 13, 105, 53, 18, 55, 14, 30, 25, 100, 17, 52, 21, 20, 4, 100, 18, 15, 100, 102, 52, 27, 22, 100, 51, 13, 35, 8, 100, 7, 100

Offset: 1

Amarnath Murthy, Dec 20 2001

			15 is the 13th term of A055471, hence a(13)=15/(1*5) =3.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A055471, A113315.

pd[n_] := Times @@ Select[IntegerDigits[n], # > 0 &];
Select[Table[n/pd[n], {n, 1000}], IntegerQ] (* Ray Chandler, Mar 11 2014 *)

Corrected and extended by Ray Chandler, Mar 11 2014

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

Original entry on oeis.org

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

A007602 Numbers that are divisible by the product of their digits.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 24, 36, 111, 112, 115, 128, 132, 135, 144, 175, 212, 216, 224, 312, 315, 384, 432, 612, 624, 672, 735, 816, 1111, 1112, 1113, 1115, 1116, 1131, 1176, 1184, 1197, 1212, 1296, 1311, 1332, 1344, 1416, 1575, 1715, 2112, 2144

Offset: 1

N. J. A. Sloane, Mira Bernstein, Robert G. Wilson v

These are called Zuckerman numbers to base 10. [So-named by J. J. Tattersall, after Herbert S. Zuckerman. - Charles R Greathouse IV, Jun 06 2017] - Howard Berman (howard_berman(AT)hotmail.com), Nov 09 2008
This sequence is a subsequence of A180484; the first member of A180484 that is not a member of A007602 is 1114. - D. S. McNeil, Sep 09 2010
Complement of A188643; A188642(a(n)) = 1; A038186 is a subsequence; A168046(a(n)) = 1: subsequence of A052382. - Reinhard Zumkeller, Apr 07 2011
The terms of n digits in the sequence, for n from 1 to 14, are 9, 5, 20, 40, 117, 285, 747, 1951, 5229, 13493, 35009, 91792, 239791, 628412, 1643144, 4314987. Empirically, the counts seem to grow as 0.858*2.62326^n. - Giovanni Resta, Jun 25 2017
De Koninck and Luca showed that the number of Zuckerman numbers below x is at least x^0.122 but at most x^0.863. - Tomohiro Yamada, Nov 17 2017
The quotients obtained when Zuckerman numbers are divided by the product of their digits are in A288069. - Bernard Schott, Mar 28 2021

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters (2005), 2nd Edition, p. 86 (see problems 44-45).

Reinhard Zumkeller and Zak Seidov, Table of n, a(n) for n = 1..10000
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.
Qizheng He and Carlo Sanna, Counting numbers that are divisible by the product of their digits, arXiv:2403.14812 [math.NT], 2024.
Giovanni Resta, Zuckerman numbers, Numbers Aplenty.
Index entries for Colombian or self numbers and related sequences

Cf. A034709, A001103, A005349, A288069.
Cf. A286590 (for factorial-base analog).
Subsequence of A002796, A034838, and A055471.

import Data.List (elemIndices)
a007602 n = a007602_list !! (n-1)
a007602_list = map succ $ elemIndices 1 $ map a188642 [1..]
-- Reinhard Zumkeller, Apr 07 2011

[ n: n in [1..2144] | not IsZero(&*Intseq(n)) and IsZero(n mod &*Intseq(n)) ];  // Bruno Berselli, May 28 2011

filter:= proc(n)
local p;
p:= convert(convert(n,base,10),`*`);
p <> 0 and n mod p = 0
end proc;
select(filter, [$1..10000]); # Robert Israel, Aug 24 2014

zuckerQ[n_] := Module[{d = IntegerDigits[n], prod}, prod = Times @@ d; prod > 0 && Mod[n, prod] == 0]; Select[Range[5000], zuckerQ] (* Alonso del Arte, Aug 04 2004 *)

for(n=1,10^5,d=digits(n);p=prod(i=1,#d,d[i]);if(p&&n%p==0,print1(n,", "))) \\ Derek Orr, Aug 25 2014

from operator import mul
from functools import reduce
A007602 = [n for n in range(1,10**5) if not (str(n).count('0') or n % reduce(mul, (int(d) for d in str(n))))] # Chai Wah Wu, Aug 25 2014

A342445 Numbers that are divisible by their nonzero digits but are not divisible by the product of their nonzero digits.

Original entry on oeis.org

22, 33, 44, 48, 55, 66, 77, 88, 99, 122, 124, 126, 155, 162, 168, 184, 202, 204, 222, 244, 248, 264, 280, 288, 303, 324, 330, 333, 336, 366, 396, 404, 408, 412, 420, 424, 440, 444, 448, 488, 505, 515, 555, 606, 636, 648, 660, 666, 707, 728, 770, 777, 784, 808, 824, 840

Offset: 1

Bernard Schott, Mar 20 2021

Numbers that are divisible by the product of their nonzero digits (A055471) are trivially divisible by each of their nonzero digits (A002796), but the converse is false. This sequence = A002796 \ A055471 and consists of these counterexamples.

This sequence differs from A337163: the first sixteen terms are the same but a(17) = 202 while A337163(17) = 222.

			204 is divisible by 2 and 4 but 204 is not divisible by 2*4 = 8, hence 204 is a term.
248 is divisible by 2, by 4 and by 8 but 248 is not divisible by 2*4*8 = 64, hence 248 is a term.

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

Equals A002796 \ A055471.

Cf. A337163 = A034838 \ A007602 (subsequence of zeroless numbers).

q[n_] := AllTrue[(d = Select[IntegerDigits[n], # > 0 &]), Divisible[n, #] &] && ! Divisible[n, Times @@ d]; Select[Range[840], q] (* Amiram Eldar, Mar 21 2021 *)
dnzQ[n_]:=With[{c=DeleteCases[IntegerDigits[n],0]},Union[Boole[Divisible[n,c]]]=={1}&&!Divisible[n,Times@@c]]; Select[ Range[ 1000],dnzQ] (* Harvey P. Dale, Jan 16 2025 *)

isok(m) = my(d=select(x->(x != 0), digits(m))); (m % vecprod(d)) && (sum(k=1, #d, m % d[k]) == 0); \\ Michel Marcus, Mar 22 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

A346537 Squares that are divisible by the product of their nonzero digits.

Original entry on oeis.org

1, 4, 9, 36, 100, 144, 400, 900, 1024, 1296, 2304, 2500, 2916, 3600, 10000, 11664, 12100, 14400, 22500, 32400, 40000, 41616, 78400, 82944, 90000, 102400, 110224, 121104, 122500, 129600, 152100, 176400, 186624, 200704, 202500, 219024, 230400, 250000, 260100, 291600

Offset: 1

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

			For the perfect square 1024 = 32^2 the product of its nonzero digits is 8 which divides 1024.

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 and A055471.

Select[Range[500]^2, Divisible[#, Times @@ Select[IntegerDigits[#], #1 > 0 &]] &] (* Amiram Eldar, Jul 23 2021 *)

isok(m) = issquare(m) && !(m % vecprod(select(x->(x>0), digits(m))));
lista(nn) = for (m=1, nn, if (isok(m^2), print1(m^2, ", "))); \\ Michel Marcus, Jul 23 2021

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

A346563 a(n) = n + A007978(n).

Original entry on oeis.org

3, 5, 5, 7, 7, 10, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 22, 21, 23, 23, 25, 25, 29, 27, 29, 29, 31, 31, 34, 33, 35, 35, 37, 37, 41, 39, 41, 41, 43, 43, 46, 45, 47, 47, 49, 49, 53, 51, 53, 53, 55, 55, 58, 57, 59, 59, 61, 61, 67, 63, 65, 65, 67, 67

Offset: 1

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

Beginning at n=3, a(n) represents the maximum length of consecutive numbers that are divisible by the product of their nonzero digits in base n. In particular, if n=10, the sequence of numbers that are divisible by the product of their nonzero digits is given by A055471.

			For n=6, the least non-divisor of 6 is 4, so a(6) = 6+4 = 10. As seen in the Comments section, 55980, 55981, ..., 55989 form a sequence of length 10, where every number is divisible by the product of its nonzero digits in base n=6. Work has been done to show that 10 is the maximum length for such sequences.

Cf. A000027, A007978, A055471.

a[n_] := Module[{k = 1}, While[Divisible[n, k], k++]; n + k]; Array[a, 100] (* Amiram Eldar, Jul 23 2021 *)

a(n) = my(k=2); while(!(n % k), k++); n+k; \\ Michel Marcus, Jul 23 2021

goal = 100
these = []
n = 1
while n <= goal:
    k = 1
    while n % k == 0:
        k = k + 1
    these.append(n + k)
    n += 1
print(these)

a(2k+1) = 2k+3.

a(2k) >= 2k+3.

A346657 Numbers that are not divisible by the product of their nonzero digits.

Original entry on oeis.org

13, 14, 16, 17, 18, 19, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 84, 85, 86, 87

Offset: 1

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

			The product of the nonzero digits of 42 is 4*2 = 8, which does not divide 42.

Complement of A055471.

Select[Range[100], !Divisible[#, Times @@ Select[IntegerDigits[#], #1 > 0 &]] &] (* Amiram Eldar, Jul 27 2021 *)

isok(k) = k % vecprod(select(x->(x>0), digits(k))); \\ Michel Marcus, Jul 28 2021

from math import prod
def ok(n): return n > 0 and n%prod([int(d) for d in str(n) if d != '0'])
print(list(filter(ok, range(88)))) # Michael S. Branicky, Jul 27 2021

cp's OEIS Frontend

A066355 A055471(n)/(product of nonzero digits of A055471(n)).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

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

A007602 Numbers that are divisible by the product of their digits.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

A342445 Numbers that are divisible by their nonzero digits but are not divisible by the product of their nonzero digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Python

A346537 Squares that are divisible by the product of their nonzero digits.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

A346563 a(n) = n + A007978(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI