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 A284833 #9 Apr 05 2017 04:47:05
%S A284833 0,1,1,2,2,5,3,7,6,11,8,17,12,22,21,28,27,41,35,53,52,66,66,90,85,112,
%T A284833 114,140,143,182,180,219,236,269,291,342,353,417,444,508,540,625,657,
%U A284833 751,812,901,974,1097,1168,1313,1414,1562,1684,1874,2008,2219,2397,2626,2832,3121,3341,3668,3956,4305,4650
%N A284833 Expansion of Sum_{i>=1} x^prime(i)/(1 - x^prime(i)) * Product_{j=1..i} 1/(1 - x^prime(j)).
%C A284833 Total number of largest parts in all partitions of n into prime parts.
%H A284833 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A284833 G.f.: Sum_{i>=1} x^prime(i)/(1 - x^prime(i)) * Product_{j=1..i} 1/(1 - x^prime(j)).
%e A284833 a(10) = 11 because we have [7, 3], [5, 5], [5, 3, 2], [3, 3, 2, 2], [2, 2, 2, 2, 2] and 1 + 2 + 1 + 2 + 5 = 11.
%t A284833 nmax = 65; Rest[CoefficientList[Series[Sum[x^Prime[i]/(1 - x^Prime[i]) Product[1/(1 - x^Prime[j]), {j, 1, i}], {i, 1, nmax}], {x, 0, nmax}], x]]
%o A284833 (PARI) x='x+O('x^66); concat([0], Vec(sum(i=1, 66, x^prime(i)/(1 - x^prime(i)) * prod(j=1,i, 1/(1 - x^prime(j)))))) \\ _Indranil Ghosh_, Apr 04 2017
%Y A284833 Cf. A000607, A046746, A084993, A092311, A281544, A284827.
%K A284833 nonn
%O A284833 1,4
%A A284833 _Ilya Gutkovskiy_, Apr 03 2017