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 A157678 #8 Jan 27 2019 21:03:01 %S A157678 1,12,16,27,30,34,38,41,56,63,67,70,74,89,92,96,101,102,105,107,112, %T A157678 125,128,130,136,146,147,154,161,164,168,175,186,188,190,193,208,210, %U A157678 219,226,229,231,236,237,247,254,258,265,273,276,278,280,290,305,308,309 %N A157678 Numbers k such that k + floor(average of digits of k) is prime. %H A157678 Charles R Greathouse IV, <a href="/A157678/b157678.txt">Table of n, a(n) for n = 1..10000</a> %e A157678 n = 89 -> 89 + floor((8+9)/2) = 89 + 8 = 97 (prime). %e A157678 n = 190 -> 190 + floor((1+9+0)/3) = 190 + 3 = 193 (prime). %p A157678 a := proc (n) local nn: nn := convert(n, base, 10): if isprime(n+floor(add(nn[j], j = 1 .. nops(nn))/nops(nn))) = true then n else end if end proc: seq(a(n), n = 1 .. 350); # _Emeric Deutsch_, Mar 07 2009 %o A157678 (PARI) is(n)=isprime(sumdigits(n)\#digits(n)+n) \\ _Charles R Greathouse IV_, Dec 27 2013 %Y A157678 Cf. A172367. %K A157678 nonn,base %O A157678 1,2 %A A157678 _Kyle D. Balliet_, Mar 04 2009 %E A157678 Corrected and extended by _Emeric Deutsch_, Mar 07 2009