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 A298073 #17 Sep 13 2018 16:40:13
%S A298073 4,52,156,172,210,256,262,372,510,536,562,592,606,652,732,946,976,998,
%T A298073 1072,1102,1122,1186,1222,1238,1366,1460,1500,1510,1540,1746,1752,
%U A298073 1762,1772,1898,1906,1916,2070,2180,2286,2400,2408,2416,2448,2676,2902,2962
%N A298073 The first of three consecutive integers the sum of which is equal to the sum of three consecutive prime numbers.
%C A298073 Also: Number m such that 3 * m + 6 is the sum of three consecutive primes. - _David A. Corneth_, Jan 12 2018
%H A298073 Colin Barker, <a href="/A298073/b298073.txt">Table of n, a(n) for n = 1..1000</a>
%e A298073 52 is in the sequence because 52 + 53 + 54 = 159 = 47 + 53 + 59.
%t A298073 Block[{nn = 430, s}, s = Total /@ Partition[Prime@ Range[nn], 3, 1]; Select[Partition[Range[Prime@ nn], 3, 1], MemberQ[s, Total@ #] &]][[All, 1]] (* _Michael De Vlieger_, Jan 11 2018 *)
%t A298073 (#-3)/3&/@Select[Total/@Partition[Prime[Range[500]],3,1],Mod[#,3]==0&] (* _Harvey P. Dale_, Sep 13 2018 *)
%o A298073 (PARI) L=List(); forprime(p=2, 4000, q=nextprime(p+1); r=nextprime(q+1); t=p+q+r; if((t-3)%3==0, listput(L, (t-3)/3))); Vec(L)
%Y A298073 Cf. A054643.
%Y A298073 Cf. A075540: the second of the three consecutive integers.
%K A298073 nonn
%O A298073 1,1
%A A298073 _Colin Barker_, Jan 11 2018
%E A298073 New name by _David A. Corneth_, Jan 12 2018