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 A293697 #16 Jun 03 2024 08:52:54
%S A293697 2,3,12,24,119,341,1219,4361,16467,57641,208987,780915,2838550,
%T A293697 10676000,39472122,148231324,559305605,2106222351,7995067942,
%U A293697 30299372141,115430379568,440354051430,1683364991290,6448757014608,24754017328490,95132828618112,366232755206338
%N A293697 a(n) is the sum of prime numbers between 2^n+1 and 2^(n+1).
%e A293697 From _Gus Wiseman_, Jun 02 2024: (Start)
%e A293697 Row-sums of:
%e A293697 2
%e A293697 3
%e A293697 5 7
%e A293697 11 13
%e A293697 17 19 23 29 31
%e A293697 37 41 43 47 53 59 61
%e A293697 67 71 73 79 83 89 97 101 103 107 109 113 127
%e A293697 (End)
%t A293697 Table[Plus @@
%t A293697 Table[Prime[i], {i, PrimePi[2^(n)] + 1, PrimePi[2^(n + 1)]}], {n, 0,
%t A293697 24}]
%Y A293697 Cf. A036378 (number of primes summed).
%Y A293697 Cf. A293696 (triangle of partial sums).
%Y A293697 Minimum is A014210 or A104080, indices A372684.
%Y A293697 Maximum is A014234, delta A013603.
%Y A293697 Counting all numbers (not just prime) gives A049775.
%Y A293697 For squarefree instead of prime numbers we have A373123, length A077643.
%Y A293697 For prime indices we have A373124.
%Y A293697 Partial sums give A130739(n+1).
%Y A293697 Cf. A000040, A001223, A029931, A035100, A046933, A061398, A092131.
%K A293697 nonn
%O A293697 0,1
%A A293697 _Olivier Gérard_, Oct 15 2017