A061763 Numbers k such that k is divisible by A061762(k) and the product of digits of k (A007954(k)) is not zero.

19, 29, 39, 42, 49, 59, 69, 79, 89, 99, 126, 132, 285, 312, 522, 594, 1134, 1144, 1159, 1211, 1275, 1323, 1365, 1573, 1632, 1634, 1674, 1715, 1813, 1815, 1911, 1919, 1932, 1944, 2133, 2139, 2516, 2793, 3132, 3135, 3161, 3211, 3213, 3216, 3321, 3363, 3393

Offset

1,1

Comments

Intersection of A038366 and A052382 (zeroless numbers). - Michel Marcus, Oct 29 2019

References

S. Parmeswaran, S+P numbers, Mathematics Informatics Quarterly, Vol. 9, No. 3 Sept. 1999, Bulgaria.

Links

Giovanni Resta, Table of n, a(n) for n = 1..10000 (first 1001 terms from Harry J. Smith)

Example

42 is a term as 4+2 + 2*4 = 14 and 42 = 14*3.

Mathematica

Select[Range[3400], (y = Times @@ (x = IntegerDigits[#])) != 0 && Divisible[#, Plus @@ x + y] &] (* Jayanta Basu, Jul 14 2013 *)

Prog

(PARI) SumD(x)= { s=0; while (x>9, s=s+x-10*(x\10); x=x\10); return(s + x) }
ProdD(x)= { p=1; while (x>9, p=p*(x-10*(x\10)); x=x\10); return(p*x) }
{ n=-1; for (m=0, 1249222, p=ProdD(m); if (p && m%(SumD(m) + p) == 0, write("b061763.txt", n++, " ", m)) ) } \\ Harry J. Smith, Jul 27 2009
(PARI) isok(k) = my(d=digits(k)); vecmin(d) && ((k % (vecprod(d) + vecsum(d))) == 0);

Crossrefs

Cf. A061762, A038366, A052382.

Sequence in context: A139539 A191047 A047985 * A088474 A087097 A038364

Adjacent sequences: A061760 A061761 A061762 * A061764 A061765 A061766

Keyword

nonn,base,easy

Author

Amarnath Murthy, May 20 2001

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 23 2001

Offset corrected by Giovanni Resta, Oct 29 2019

Status

approved