cp's OEIS Frontend

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.

A352233 Numbers that can be expressed as the sum of two primes in exactly 10 ways.

This page as a plain text file.
%I A352233 #25 Aug 11 2025 10:25:09
%S A352233 114,126,162,260,290,304,316,328,344,352,358,374,382,416,542,632
%N A352233 Numbers that can be expressed as the sum of two primes in exactly 10 ways.
%C A352233 All terms are even. Conjecture: 632 is the last term. Hardy and Littlewood conjectured a growth rate of the number of decompositions for large even numbers (see Conjecture A in page 32 of Hardy and Littlewood reference), implying this sequence is finite. - _Chai Wah Wu_, Mar 10 2022
%H A352233 G. H. Hardy and J. E. Littlewood, <a href="https://doi.org/10.1007/BF02403921">Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes</a>, Acta Mathematica, volume 44, pages 1-70 (1923).
%e A352233 114 = 5+109 = 7+107 = 11+103 = 13+101 = 17+97 = 31+83 = 41+73 = 43+71 = 47+67 = 53+61.
%t A352233 c[n_] := Count[IntegerPartitions[n, {2}], _?(And @@ PrimeQ[#] &)]; Select[Range[1000], c[#] == 10 &] (* _Amiram Eldar_, Mar 08 2022 *)
%Y A352233 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), A067191 (k=5), A066722 (k=6), A352229 (k=7), A352230 (k=8), A352231 (k=9), this sequence (k=10).
%K A352233 nonn,more
%O A352233 1,1
%A A352233 _Wesley Ivan Hurt_, Mar 08 2022