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 A320881 #4 Nov 09 2018 04:12:24
%S A320881 4,6,10,13,14,17,25,28,29,35,40,46,47,50,58,61,68,73,79,80,83,94,95,
%T A320881 103,106,107,113,115,118,119,136,137,148,152,158,163,170,173,181,184,
%U A320881 191,196,202,206,214,215,218,230,238,241,242,248,253,259,271,274,281,286,292,293,296,307,316
%N A320881 Numbers equal to a prime plus its digit sum.
%C A320881 Sequence A048520 lists the primes in this sequence.
%e A320881 a(1) = 4 = 2 + 2 = (the smallest prime, 2 = prime(1)) + (digit sum of 2).
%e A320881 Similarly, a({2, 3, 5}) = 2*prime({2, 3, 4}), since the digit sum of single-digit primes is the prime itself.
%e A320881 a(4) = 13 = 11 + (1 + 1) = A048520(1), the first prime in this sequence.
%e A320881 a(6) = 17 = 13 + (1 + 3) = A048520(2), the second prime in this sequence.
%o A320881 (PARI) is_A320881(n)=select(p->p+sumdigits(p)==n, primes([n-9*#digits(n), n-2])) \\ Returns the list of all "solutions"; this has the boolean value of true iff the list is nonempty. - _M. F. Hasler_, Nov 08 2018
%Y A320881 Cf. A062028 (n + its digit sum), A047791 (A062028(n) is prime), A048519 (primes in A047791).
%K A320881 nonn,base
%O A320881 1,1
%A A320881 _M. F. Hasler_, Nov 08 2018