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 A067191 #24 Mar 10 2022 10:31:46
%S A067191 48,54,64,70,74,76,82,86,94,104,124,136,148,158,164,188
%N A067191 Numbers that can be expressed as the sum of two primes in exactly five ways.
%C A067191 There are no other terms below 10000 and I conjecture there are no further terms in this sequence and A067188, A067189, etc. - Peter Bertok (peter(AT)bertok.com), Jan 13 2002
%C A067191 I believe that these conjectures follow from a more general one by Hardy and Littlewood (probably in Some problems of 'partitio numerorum' III, on the expression of a number as a sum of primes, Acta Math. 44(1922) 1-70). - _R. K. Guy_, Jan 14 2002
%C A067191 There are no further terms through 50000. - _David Wasserman_, Jan 15 2002
%H A067191 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a>
%e A067191 70 is a term as 70 = 67 + 3 = 59 + 11 = 53 + 17 = 47 + 23 41 + 29 are all the five ways to express 70 as a sum of two primes.
%t A067191 upperbound=10^4; range=ConstantArray[0,2*upperbound];
%t A067191 primeRange=Prime[Range[PrimePi[upperbound]]];
%t A067191 (range[[Plus@@#]]++)&/@(DeleteDuplicates[Sort[#]&/@Tuples[primeRange,2]]);{"upperbound="<>ToString[upperbound],Flatten[Position[Take[range,upperbound],5]]} (* _Hans Rudolf Widmer_, Jul 06 2021 *)
%Y A067191 Cf. A002375, A023036.
%Y A067191 Numbers that can be expressed as the sum of two primes in k ways for k=0..10: A014092 (k=0), A067187 (k=1), A067188 (k=2), A067189 (k=3), A067190 (k=4), this sequence (k=5), A066722 (k=6), A352229 (k=7), A352230 (k=8), A352231 (k=9), A352233 (k=10).
%K A067191 nonn,fini,full
%O A067191 1,1
%A A067191 _Amarnath Murthy_, Jan 10 2002
%E A067191 Corrected and extended by Peter Bertok (peter(AT)bertok.com), Jan 13 2002