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 A241525 #13 May 05 2014 11:23:33 %S A241525 19,17,13,521,509,503,499,491,14153,25793,25771,37663,37657,98729, %T A241525 98717,98713,98711,98689,98669,98663,98641,98639,98627,98621,98597, %U A241525 98573,69794393,69794383,268684679,268684651,268684627,329788829,545497787,545497769,545497759,545497753,545497747,545497741,545497727,545497723,545497691,545497681,545497679,545497637,545497633,545497609 %N A241525 a(n) is the smallest start of a run of exactly n consecutive primes such that the sum of the digits of each prime is composite. %C A241525 No more terms below 2^32 %e A241525 a(3)=13 because the run of the 3 consecutive primes {13, 17, 19} is such that the sum of digits for each prime is {4, 8, 10}. %o A241525 (UBASIC) %o A241525 10 P=1:KM=0:K=0:'puzzle 1290, Meller %o A241525 20 P=nxtprm(P):if P>2^32-20 then end %o A241525 30 gosub *SODP:if S<>prmdiv(S) then K=K+1:Q=P:goto 20 %o A241525 40 if K>KM then print K, Q:KM=K %o A241525 50 K=0:goto 20 %o A241525 200 *SODP:S=0:L=alen(P) %o A241525 210 for I=1 to L:D=val(mid(str(P), I+1, 1)) %o A241525 220 S=S+D:next I %o A241525 230 return %Y A241525 Cf. A240598. %K A241525 nonn,base %O A241525 1,1 %A A241525 _Carlos Rivera_, Apr 24 2014