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 A199124 #17 Mar 31 2012 13:48:49
%S A199124 2,13,107,1009,10037,100049,1000099,10000379,100000399,1000000787,
%T A199124 10000000799,100000001989,1000000001999,10000000003999,
%U A199124 100000000006997,1000000000017899,10000000000018999,100000000000038989,1000000000000067999,10000000000000079899,100000000000000079999
%N A199124 Least prime having 1 more digit and higher sum of digits than the preceding term.
%C A199124 For more terms use the formula a(n)=10^(n-1)+A199190(n) and the values listed in A199190.
%F A199124 A199124(n) = 10^(n-1)+A199190(n); see there for an estimate of growth.
%o A199124 (PARI) {print1(p=2);for(d=1,20,o=A007953(p);p=10^d; until(A007953(p=nextprime(p+1))>o,);print1(","p))}
%Y A199124 Cf. A065122.
%K A199124 nonn,base
%O A199124 1,1
%A A199124 _M. F. Hasler_, Nov 03 2011