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 A339222 #7 Dec 09 2020 04:18:20
%S A339222 1,0,0,0,1,0,2,0,2,1,3,0,6,1,6,3,10,2,15,4,18,9,25,8,38,14,44,24,62,
%T A339222 26,86,39,105,61,139,70,191,100,230,144,304,173,400,235,490,326,629,
%U A339222 395,819,525,996,701,1269,859,1617,1114,1974,1456,2475,1783,3124,2279,3793,2920
%N A339222 Number of partitions of n into parts >= 2 where every part appears at least 2 times.
%H A339222 Vaclav Kotesovec, <a href="/A339222/b339222.txt">Table of n, a(n) for n = 0..10000</a>
%H A339222 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A339222 G.f.: Product_{k>=2} (1 + x^(2*k) / (1 - x^k)).
%F A339222 a(n) ~ exp(2*Pi*sqrt(n)/3) * Pi / (18*sqrt(2)*n^(3/2)). - _Vaclav Kotesovec_, Dec 09 2020
%e A339222 a(12) = 6 because we have [6, 6], [4, 4, 4], [4, 4, 2, 2], [3, 3, 3, 3], [3, 3, 2, 2, 2] and [2, 2, 2, 2, 2, 2].
%t A339222 nmax = 63; CoefficientList[Series[Product[1 + x^(2 k)/(1 - x^k), {k, 2, nmax}], {x, 0, nmax}], x]
%Y A339222 Cf. A002865, A007690.
%K A339222 nonn
%O A339222 0,7
%A A339222 _Ilya Gutkovskiy_, Nov 27 2020