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 A052430 #12 Nov 09 2021 05:49:33
%S A052430 2,3,5,7,12,21,113,115,131,151,311,511,1112,1121,1211,2111,11113,
%T A052430 11117,11131,11171,11311,11711,13111,17111,31111,71111,111112,111121,
%U A052430 111211,112111,121111,211111,1111115,1111117,1111151,1111171,1111511,1111711
%N A052430 Numbers n such that sum of digits and product of digits are both prime.
%C A052430 One digit must be 2, 3, 5, or 7 and every other digit must be 1. If k is in the sequence, then so is every permutation of the digits of k. - _Sean A. Irvine_, Nov 08 2021
%H A052430 Sean A. Irvine, <a href="/A052430/b052430.txt">Table of n, a(n) for n = 1..994</a>
%e A052430 a(7)=115 because 1+1+5=7 which is prime and 1*1*5=5 which is prime
%t A052430 okQ[n_]:=Module[{idn=IntegerDigits[n]},PrimeQ[Total[idn]]&&PrimeQ[Times@@idn]]
%t A052430 Select[Range[1500000],okQ] (* _Harvey P. Dale_, Dec 15 2010 *)
%Y A052430 Cf. A000040, A028834, A028842.
%K A052430 base,nonn
%O A052430 1,1
%A A052430 _Henry Bottomley_, Mar 14 2000