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 A104230 #17 Feb 16 2025 08:32:56 %S A104230 2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,2,2,2,2,2,3,2,3,2,2,2,2,2,3,2,2,2,2, %T A104230 2,2,2,3,2,3,2,2,2,3,2,2,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,2,2,3,2,3,2,2,2 %N A104230 Minimal number of primes needed to sum to n^2. %C A104230 For the Goldbach conjecture every even number that is greater than 2 is the sum of three primes and odd number is the sum of three primes, no term is greater 3. %H A104230 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GoldbachConjecture.html">Goldbach Conjecture </a>. %F A104230 a(n) = A051034(A000290(n)). - _Michel Marcus_, Jun 04 2013 %e A104230 a(2)=2 because 2^2=2+2; %e A104230 a(3)=2 because 3^2=2+7. %K A104230 easy,nonn %O A104230 2,1 %A A104230 _Giovanni Teofilatto_, Apr 02 2005 %E A104230 Corrected and extended by _Michel Marcus_, Jun 04 2013