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 A117528 #6 Apr 21 2024 11:39:52 %S A117528 2,3,13,41,43,109,137,167,181,199,307,373,421,491,587,661,1009,1097, %T A117528 1117,1373,1471,1483,1601,1607,1787,1913,2053,2089,2203,2267,2591, %U A117528 2819,2953,3191,3361,3623,3691,3779,3877,4051 %N A117528 Prime at which the cumulative sum in A117527 is prime. %C A117528 At the twin primes 41 and 43, we obtain consecutive prime integer sums of 641 and 757. %F A117528 Multiply consecutive primes by e, take integer, sum until a prime sum is reached. %e A117528 In a(5)=4007, multiplication of the prime 109*e resulted in the int sum 296. When added to previous sums, the total came to 4007, a prime. %o A117528 (UBASIC) %o A117528 10 Ct=1 %o A117528 20 B=nxtprm(B) %o A117528 22 E=#e %o A117528 30 C=int(B*E) %o A117528 40 D=D+C %o A117528 41 print Ct,B,C,D %o A117528 50 if D=prmdiv(D) then print D:stop %o A117528 55 Ct=Ct+1 %o A117528 60 goto 20 %Y A117528 Cf. A117527 A117504. %K A117528 easy,nonn %O A117528 1,1 %A A117528 _Enoch Haga_, Mar 25 2006