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 A370111 #66 Mar 04 2024 22:06:22 %S A370111 2,17,5,19,29,4831,1235791,61483,126064739,32485822049 %N A370111 Least prime p such that the sum of 2i - 1 consecutive primes starting with p is prime for each i <= n and not prime for i = n+1, and -1 if no such prime exists. %e A370111 a(1) = 2: This is because the sum of 1 consecutive prime number starting with 2 (which is just 2 itself) is also a prime number. Additionally, the sum of 2 * 2 - 1 = 3 consecutive primes starting with 2 (i.e., 2 + 3 + 5 = 10 = 2 * 5) is not prime, and no smaller prime number satisfies this condition. %e A370111 a(2) = 17: 17 is prime and the sum of 2*2 - 1 = 3 consecutive primes starting with 17 (i.e., 17 + 19 + 23 = 59) is a prime number. However, the sum of 2 * 3 - 1 = 5 consecutive primes starting with 17 (i.e., 17 + 19 + 23 + 29 + 31 = 119 = 7 * 17) is not prime, and no lesser prime number meets this requirement. %o A370111 (PARI) card(p)=my(c=0,q=p,s=q);while(isprime(s),c++;for(i=1,2,q=nextprime(q+2);s+=q));c %o A370111 a(n)=if(n==1,return(2));forprime(p=3,+oo,my(x=card(p));if(x==n,return(p))) %Y A370111 Cf. A370139. %K A370111 more,nonn %O A370111 1,1 %A A370111 _Jean-Marc Rebert_, Feb 12 2024