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 A331849 #6 Feb 11 2025 16:41:44
%S A331849 0,0,0,0,1,0,2,1,2,3,3,5,5,7,8,10,11,15,15,20,22,26,31,35,41,47,54,62,
%T A331849 71,80,92,102,117,131,148,166,186,208,233,259,290,322,357,398,439,488,
%U A331849 539,595,657,723,796,877,962,1057,1159,1268,1391,1520,1663,1815,1981
%N A331849 Number of partitions of n into prime parts with some part repeated.
%H A331849 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A331849 a(n) = A000607(n) - A000586(n).
%e A331849 a(9) = 3 because we have [5, 2, 2], [3, 3, 3] and [3, 2, 2, 2].
%t A331849 Table[Count[IntegerPartitions[n],_?(AllTrue[#,PrimeQ]&&Length[Union[#]]<Length[#]&)],{n,0,60}] (* _Harvey P. Dale_, Feb 11 2025 *)
%Y A331849 Cf. A000586, A000607, A047967, A261982, A331848.
%K A331849 nonn
%O A331849 0,7
%A A331849 _Ilya Gutkovskiy_, Jan 29 2020