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 A138566 #13 Jun 14 2024 23:20:04
%S A138566 36,44,63,66,138,145,154,159,167,176,183,195,224,235,242,253,257,275,
%T A138566 279,297,318,325,333,345,352,354,357,375,381,415,422,435,451,453,514,
%U A138566 519,523,527,532,534,537,541,543,572,573,591,617,671,716,725,729,735
%N A138566 Numbers n whose digits satisfy the following Diophantine equation: P = (X1* ... *Xr)/(X1+ ... +Xr), where P = prime number, Xi = digits of n.
%e A138566 n = 761, we have (7*6*1)/(7+6+1) = 3; a(56)= 761.
%e A138566 n = 792, we have (7*9*2)/(7+9+2) = 7; a(57)= 792.
%e A138566 n = 813, we have (8*1*3)/(8+1+3) = 2; a(58)= 813.
%t A138566 Block[{i = k, r = {}}, r = Table[p = IntegerDigits@i; If[PrimeQ[Times @@ p/Total@p], k, Nothing], {k, 735}];r] (* _Mikk Heidemaa_, May 26 2024 *)
%Y A138566 Subsequence of A038367.
%Y A138566 Cf. A137923.
%K A138566 base,easy,nonn
%O A138566 1,1
%A A138566 _Ctibor O. Zizka_, May 12 2008