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 A350713 #24 Mar 07 2022 02:13:15
%S A350713 3,19,73,173,293,523,751,1093,1789,1877,2803,3457,3917,4909,5569,6961,
%T A350713 7753,9341
%N A350713 Maximum smallest prime required to generate all Goldbach partitions to 10^n.
%C A350713 The magnitude of the smallest prime required in a Goldbach partition of 2n is very small in comparison to the magnitude of the sum, 2n.
%e A350713 The first three partitions with the smallest first member are (3,3), (3,5), and (3,7), so the smallest prime required to generate all Goldbach partitions up through 10^1 is 3.
%t A350713 gp = Compile[{{n, _Integer}}, Block[{p = 2}, While[! PrimeQ[n - p], p = NextPrime@p]; p]]; a[n] = 3; a[n_] := Block[{k = 10^(n - 1), lmt = 10^n + 1, mx = 0}, While[k < lmt, b = gp@k; If[b > mx, mx = b]; k += 2]; mx]; (* _Robert G. Wilson v_, Mar 04 2022 *)
%Y A350713 Cf. A025018, A025019.
%K A350713 nonn,more
%O A350713 1,1
%A A350713 _Barry Cherkas_, Feb 02 2022
%E A350713 a(9)-a(18) from _Robert G. Wilson v_, Mar 04 2022