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 A066613 #24 Dec 08 2024 23:51:29
%S A066613 1,2,14,22,24,32,42,116,122,126,141,202,211,221,222,260,280,340,402,
%T A066613 411,440,512,620,840,1021,1041,1062,1114,1118,1128,1132,1141,1144,
%U A066613 1201,1202,1206,1218,1222,1242,1250,1314,1332,1340,1380,1401,1411,1602,1611
%N A066613 Numbers k such that the product of the nonzero digits of k equals the number of divisors of k.
%H A066613 Giovanni Resta, <a href="/A066613/b066613.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%e A066613 24 is a term as there are 8 divisors of 24 = 2*4.
%t A066613 f[n_] := Block[ {a = Sort[ IntegerDigits[n]] }, While[ First[a] == 0, a = Drop[a, 1]]; Return[ Apply[ Times, a]]]; Select[ Range[10^4], f[ # ] == Length[ Divisors[ # ]] & ]
%t A066613 pndQ[n_]:=Times@@Select[IntegerDigits[n],#!=0&]==DivisorSigma[0,n]; Select[Range[2000],pndQ] (* _Harvey P. Dale_, Oct 25 2016 *)
%o A066613 (PARI) isok(k) = { vecprod(select(x->(x!=0), digits(k))) == numdiv(k) } \\ _Harry J. Smith_, Mar 12 2010
%Y A066613 Cf. A000005, A051801, A074312.
%K A066613 nonn,base
%O A066613 1,2
%A A066613 _Amarnath Murthy_, Dec 24 2001
%E A066613 Corrected and extended by _Jason Earls_ and _Robert G. Wilson v_, Dec 26 2001