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 A129081 #17 May 19 2018 02:31:32
%S A129081 19,107,523,1279,1787,4091,16103,18041,46889,68437,104561,155443,
%T A129081 161641,174367,187573,303473,330587,359231,419929,430517,634793,
%U A129081 878939,974507,1469753,1510319,1700851,1902653,2836961,2982841,3476299,3807589
%N A129081 Primes appearing in partial sums of A030433 (primes ending in 9).
%H A129081 Muniru A Asiru, <a href="/A129081/b129081.txt">Table of n, a(n) for n = 1..3000</a>
%F A129081 a(n) = A030433(1)+A030433(2)+...+A030433(x); a is a prime number.
%e A129081 a(5) = 1787 because 1787 = A030433(1) + A030433(2) + A030433(3) + A030433(4) + A030433(5) + A030433(6) + A030433(7) + A030433(8) + A030433(9) + A030433(10) + A030433(11) + A030433(12) + A030433(13) = 19 + 29 + 59 + 79 + 89 + 109 + 139 + 149 + 179 + 199 + 229 + 239 + 269; and 1787 is a prime number.
%t A129081 With[{pr9s=Select[Prime[Range[3000]],Last[IntegerDigits[#]]==9&]}, Select[ Accumulate[ pr9s],PrimeQ]] (* _Harvey P. Dale_, Dec 31 2011 *)
%o A129081 (PARI) {s=0; forprime(p=2, 17300, if(p%10==9, s+=p; if(isprime(s), print1(s, ","))))} /* _Klaus Brockhaus_, May 13 2007 */
%o A129081 (GAP) P:=Filtered(List([1..5*10^5],n->10*n+9),IsPrime);;
%o A129081 a:=Filtered(List([1..Length(P)],i->Sum([1..i],k->P[k])),IsPrime); # _Muniru A Asiru_, Apr 28 2018
%Y A129081 Cf. A030433, A000040.
%K A129081 easy,base,nonn
%O A129081 1,1
%A A129081 _Tomas Xordan_, May 11 2007
%E A129081 Entries checked by _Klaus Brockhaus_, May 13 2007
%E A129081 Better description from _Harvey P. Dale_, Dec 31 2011