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 A084354 #17 May 19 2019 12:48:40
%S A084354 2,11,23,29,41,43,47,61,67,89,101,149,163,167,211,223,227,229,233,251,
%T A084354 257,263,269,281,349,367,383,401,409,419,431,433,439,463,491,521,523,
%U A084354 569,587,601,607,613,617,631,643,659,661,673,761,769,809,821,827,857
%N A084354 Primes whose product of nonzero digits + 1 is prime.
%H A084354 Robert Israel, <a href="/A084354/b084354.txt">Table of n, a(n) for n = 1..10000</a>
%p A084354 filter:= proc(n) local p;
%p A084354 if not isprime(n) then return false fi;
%p A084354 p:= 1+ convert(subs(0=NULL, convert(n,base,10)),`*`);
%p A084354 isprime(p)
%p A084354 end proc:
%p A084354 select(filter, [2,seq(i,i=3..1000,2)]); # _Robert Israel_, Mar 06 2018
%t A084354 okQ[n_]:=Module[{idn=IntegerDigits[n]},PrimeQ[1+Times@@Select[idn,#>0&]]]
%t A084354 Select[Prime[Range[150]],okQ] (* _Harvey P. Dale_, Jan 20 2011 *)
%Y A084354 Cf. A066725.
%K A084354 base,easy,nonn
%O A084354 1,1
%A A084354 _Jason Earls_, Jun 22 2003