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 A352775 #5 Apr 02 2022 18:36:09
%S A352775 0,9,26,34,56,74,175,130,215,308,412,472,596,477,692,919,1123,946,
%T A352775 1497,1268,1673,2094,2436,2652,2652,2652,3229,3229,3713,4013,5372,
%U A352775 4871,4871,5768,5768,6709,8594,7953,7953,9098,10102,10648,11714,10831,12358,12358,13510
%N A352775 a(n) = pi(n) * (Sum_{n <= q < 2n, q prime} q) + (pi(2n-1) - pi(n-1)) * (Sum_{p <= n, p prime} p).
%C A352775 Sum of all the parts from all ordered pairs of prime numbers, (p,q), such that p <= n <= q < 2n.
%F A352775 a(n) = A352753(n) + A352754(n).
%e A352775 a(5) = 56; there are 6 ordered pairs of prime numbers, (p,q), such that p <= 5 <= q < 10: (2,5), (2,7), (3,5), (3,7), (5,5), and (5,7). The sum of all the parts gives 2+5+2+7+3+5+3+7+5+5+5+7 = 56.
%t A352775 Table[Sum[Sum[k (PrimePi[k] - PrimePi[k - 1]) (PrimePi[2 n - i] - PrimePi[2 n - i - 1]), {k, n}], {i, n}] + PrimePi[n] Sum[(2 n - k) (PrimePi[2 n - k] - PrimePi[2 n - k - 1]), {k, n}], {n, 100}]
%Y A352775 Cf. A000720 (pi), A073837, A352749, A352753, A352754, A352777.
%K A352775 nonn
%O A352775 1,2
%A A352775 _Wesley Ivan Hurt_, Apr 02 2022