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.

Showing 1-1 of 1 results.

A343681 Zuckerman numbers which when divided by product of their digits, give a quotient which is also a Zuckerman number.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 24, 36, 111, 128, 135, 144, 175, 384, 672, 735, 1111, 1296, 1575, 11111, 22176, 42624, 82944, 111111, 139968, 688128, 719712, 1111111, 1161216, 1492992, 2241792, 2794176, 4136832, 4741632, 6838272, 11111111, 12171264, 13395375, 13436928
Offset: 1

Views

Author

Bernard Schott, Apr 26 2021

Keywords

Comments

Alternative Name: Zuckerman numbers k such that k/(product of digits of k) is also a Zuckerman number. - Wesley Ivan Hurt, Apr 26 2021
All positive repunits are terms (A002275).

Examples

			24 is a Zuckerman number as 24/(2*4) = 3, 3/3 = 1 so 3 is also a Zuckerman number, and 24 is a term.
1296 is a Zuckerman number as 1296/(1*2*9*6) = 12, 12/(1*2) = 4 so 12 is also a Zuckerman number and 1296 is a term.
		

Crossrefs

Cf. A235507 (similar, with Niven numbers).

Programs

  • Mathematica
    zuckQ[n_] := (prod = Times @@ IntegerDigits[n]) > 0 && Divisible[n, prod]; Select[Range[10^6], zuckQ[#] && zuckQ[#/Times @@ IntegerDigits[#]] &] (* Amiram Eldar, Apr 26 2021 *)
  • PARI
    isz(n) = my(p=vecprod(digits(n))); p && !(n % p); \\ A007602
    isok(n) = isz(n) && isz(n/vecprod(digits(n))); \\ Michel Marcus, Apr 26 2021

Extensions

More terms from David A. Corneth, Apr 26 2021
Showing 1-1 of 1 results.