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 A300692 #33 Jan 28 2022 17:05:56
%S A300692 2,5,17,41,202288087,4394533064208947008756469709307
%N A300692 Primes that are the sum of all primes up to some power of 2.
%C A300692 Elements in the sequence are certified primes.
%C A300692 The corresponding exponents of 2 are 1, 2, 3, 4, 16 and 54.
%H A300692 Kim Walisch, <a href="https://github.com/kimwalisch/primesum/blob/master/README.md">List of sums of primes up to 2^n with n<=80</a> (at the end).
%F A300692 Numbers of the form Sum_{i=2..2^n-1} A061397(i) that are prime.
%e A300692 17 is a term because the sum of all primes below 2^3 is 2+3+5+7 = 17 which is prime.
%t A300692 Select[Array[Total@ Prime@ Range@ PrimePi[2^#] &, 27, 0], PrimeQ] (* _Michael De Vlieger_, Apr 10 2018 *)
%o A300692 (PARI) lista(nn) = {for (n=0, nn, s = 0; forprime(k=0, 2^n, s+=k); if (isprime(s), print1(s, ", ")));}
%Y A300692 Cf. A130739, A061397.
%K A300692 nonn,more
%O A300692 1,1
%A A300692 _Christoph Zurnieden_, Apr 03 2018