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 A157677 #20 Jun 25 2019 12:44:47 %S A157677 23,29,61,67,83,101,103,107,109,163,233,239,283,293,307,347,349,401, %T A157677 409,431,439,443,449,499,503,509,563,569,601,607,613,617,619,653,659, %U A157677 677,683,701,709,743,809,907,929,941,1009,1013,1019,1021,1031,1033,1039 %N A157677 Primes p such that p + (product of digits of p) is also prime. %C A157677 If p contains a zero, then p is trivially a member. %H A157677 Robert Israel, <a href="/A157677/b157677.txt">Table of n, a(n) for n = 1..10000</a> %F A157677 a(n) ~ n log n. - _Charles R Greathouse IV_, Apr 22 2013 %e A157677 83 is prime, and 83 + 8*3 = 89 which is also prime. 103 is prime, and 103 + 1*0*3 = 103 is also prime. Thus 89 and 103 are members. %p A157677 a := proc (n) local nn: nn := convert(ithprime(n), base, 10): if isprime(ithprime(n)+product(nn[j], j = 1 .. nops(nn))) = true then ithprime(n) else end if end proc: seq(a(n), n = 1 .. 180); # _Emeric Deutsch_, Mar 08 2009 %t A157677 Select[Prime[Range[175]], PrimeQ[# + Times @@ IntegerDigits[#]] &] (* _Jayanta Basu_, Apr 22 2013 *) %o A157677 (PARI) dprod(n)=n=digits(n); prod(i=1,#n,n[i]) %o A157677 is(n)=isprime(n) && isprime(n+dprod(n)) \\ _Charles R Greathouse IV_, Dec 27 2013 %Y A157677 Union of A092518 and A056709. %Y A157677 Cf. A225303. %K A157677 nonn,base %O A157677 1,1 %A A157677 _Kyle D. Balliet_, Mar 04 2009 %E A157677 More terms from _Emeric Deutsch_, Mar 08 2009