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 A157655 #12 Dec 12 2024 10:05:40
%S A157655 11411,16111,1112113,1151113,14161111,14611111,111115141,111253111,
%T A157655 115112113,122112311,151151111,211711111,1111116211,1121123111,
%U A157655 1121181311,1211215111,1412113111,1416131111,2111121511,2111215111
%N A157655 Zeroless primes p such that the next prime after p can be obtained from p by adding the sum and product of the digits of p.
%C A157655 If we allow a zero digit in p, we generate A089824. One could conjecture that the digit 1 must always appear in the entries of this sequence. The idea for this sequence and the description was motivated by A089823.
%H A157655 Cino Hilliard, <a href="http://groups.google.com/group/pointer-primes/web/sumpointerprimes">Pointer primes</a> [broken link]
%e A157655 The digits of 11411 add up to 8. The product of the digits is 4. So 11411+8+4 = 11423, the next prime after 11411. So 11411 is in the sequence.
%t A157655 zpQ[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&NextPrime[n] == n+ Total[ idn]+Times@@idn]; Select[Prime[Range[11*10^7]],zpQ] (* _Harvey P. Dale_, Jan 14 2016 *)
%Y A157655 Cf. A089823, A089824.
%K A157655 base,nonn
%O A157655 1,1
%A A157655 _Cino Hilliard_, Mar 03 2009