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 A339241 #6 Nov 28 2020 20:03:39
%S A339241 1,0,1,1,2,1,4,2,6,5,9,7,15,11,21,19,31,27,46,40,63,60,88,83,124,117,
%T A339241 166,165,224,222,303,301,399,407,525,537,691,707,893,929,1153,1202,
%U A339241 1485,1550,1890,1992,2400,2534,3040,3212,3818,4059,4781,5089,5972,6359,7412
%N A339241 Number of partitions of n into prime power parts (including 1) where every part appears at least 2 times.
%H A339241 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A339241 G.f.: (1 + x^2 / (1 - x)) * Product_{p prime, k>=1} (1 + x^(2*p^k) / (1 - x^(p^k))).
%e A339241 a(6) = 4 because we have [3, 3], [2, 2, 2], [2, 2, 1, 1] and [1, 1, 1, 1, 1, 1].
%t A339241 nmax = 56; CoefficientList[Series[(1 + x^2/(1 - x)) Product[1 + Boole[PrimePowerQ[k]] x^(2 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A339241 Cf. A000961, A007690, A023893, A161077, A339218, A339242.
%K A339241 nonn
%O A339241 0,5
%A A339241 _Ilya Gutkovskiy_, Nov 28 2020