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 A047791 #29 Feb 17 2024 10:34:20 %S A047791 1,10,11,13,14,16,19,32,34,35,37,52,53,56,58,59,71,73,76,91,92,94,95, %T A047791 97,100,101,103,104,106,122,124,127,128,142,143,146,149,160,163,166, %U A047791 167,181,182,184,185,215,217,218,232,233,238,250,253,256,257,271,272 %N A047791 Numbers n such that n plus digit sum of n (A007953) equals a prime. %H A047791 Reinhard Zumkeller, <a href="/A047791/b047791.txt">Table of n, a(n) for n = 1..10000</a> %H A047791 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a> %F A047791 Complement of A107743. %F A047791 A062028^(-1)(A000040). - _M. F. Hasler_, Nov 08 2018 %e A047791 Digit sum of 13 = 1 + 3 = 4 -> 13 + 4 = 17 is prime. %t A047791 Select[Range[272],PrimeQ[#+Total[IntegerDigits[#]]]&] (* _Jayanta Basu_, May 03 2013 *) %o A047791 (Haskell) %o A047791 a047791 n = a047791_list !! (n-1) %o A047791 a047791_list = filter ((== 1) . a010051' . a062028) [1..] %o A047791 -- _Reinhard Zumkeller_, Sep 27 2014 %o A047791 (PARI) select( is(n)=isprime(n+sumdigits(n)), [1..300]) \\ _M. F. Hasler_, Nov 08 2018 %Y A047791 Cf. A006378, A107740. %Y A047791 Cf. A007953, A062028, A010051, A107743. %K A047791 base,easy,nonn %O A047791 1,2 %A A047791 _G. L. Honaker, Jr._ %E A047791 More terms from Larry Reeves (larryr(AT)acm.org), Nov 16 2000