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 A328179 #25 Jan 12 2020 17:35:42
%S A328179 0,1,2,3,3,4,4,5,5,5,6,6,6,7,7,7,7,7,8,9,9,9,9,9,9,9,9,9,10,10,10,10,
%T A328179 10,11,11,11,11,11,11,12,13,13,13,13,13,13,13,13,14,15,15,15,15,15,15,
%U A328179 15,15,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,17,17
%N A328179 Number of distinct primes required to satisfy the Strong Goldbach Conjecture for all even numbers <= 2n.
%C A328179 The Strong Goldbach Conjecture asserts that all positive even integers >=4 can be expressed as the sum of two primes.
%C A328179 If the Strong Goldbach Conjecture is true, then a(n) > 0 for all n > 1 and a(n) <= a(n+1) for all n.
%H A328179 Marcin Barylski, <a href="/A328179/a328179.png">Comparison of A328179 with pi(n) for the first 10^4 numbers</a>
%H A328179 Marcin Barylski, <a href="http://tas-moto.org/research/GoldbachEliminatePrimes.pdf">Redundant Primes In Goldbach Partitions</a>
%e A328179 a(1)=0 because 2 does not have any Goldbach partition.
%e A328179 a(2)=1 because 4=2+2 and 2 is the only prime required for all even numbers <= 4.
%e A328179 a(3)=2 because 4=2+2 and 6=3+3, thus 2 and 3 are required for expressing all even numbers <= 6.
%e A328179 a(7)=4 because using {2,3,5,7} it is possible to build all even numbers <= 14.
%e A328179 a(8)=5 because using either {2,3,5,7,11} or {2,3,5,7,13} it is possible to build all even numbers <= 16.
%e A328179 a(10)=5 because {2,3,5,7,13} are enough to build all even numbers <= 20.
%K A328179 nonn
%O A328179 1,3
%A A328179 _Marcin Barylski_, Oct 06 2019