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.
%I A061763 #23 Dec 05 2024 14:45:58 %S A061763 19,29,39,42,49,59,69,79,89,99,126,132,285,312,522,594,1134,1144,1159, %T A061763 1211,1275,1323,1365,1573,1632,1634,1674,1715,1813,1815,1911,1919, %U A061763 1932,1944,2133,2139,2516,2793,3132,3135,3161,3211,3213,3216,3321,3363,3393 %N A061763 Numbers k such that k is divisible by A061762(k) and the product of digits of k (A007954(k)) is not zero. %C A061763 Intersection of A038366 and A052382 (zeroless numbers). - _Michel Marcus_, Oct 29 2019 %D A061763 S. Parmeswaran, S+P numbers, Mathematics Informatics Quarterly, Vol. 9, No. 3 Sept. 1999, Bulgaria. %H A061763 Giovanni Resta, <a href="/A061763/b061763.txt">Table of n, a(n) for n = 1..10000</a> (first 1001 terms from Harry J. Smith) %e A061763 42 is a term as 4+2 + 2*4 = 14 and 42 = 14*3. %t A061763 Select[Range[3400], (y = Times @@ (x = IntegerDigits[#])) != 0 && Divisible[#, Plus @@ x + y] &] (* _Jayanta Basu_, Jul 14 2013 *) %o A061763 (PARI) isok(k) = my(d=digits(k)); vecmin(d) && ((k % (vecprod(d) + vecsum(d))) == 0); %Y A061763 Cf. A061762, A038366, A052382. %K A061763 nonn,base,easy %O A061763 1,1 %A A061763 _Amarnath Murthy_, May 20 2001 %E A061763 Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 23 2001 %E A061763 Offset corrected by _Giovanni Resta_, Oct 29 2019