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 A277210 #9 Oct 07 2016 06:29:04
%S A277210 1,0,0,0,1,0,0,1,1,0,1,1,1,1,2,1,2,2,2,2,4,3,3,4,5,4,6,6,7,7,9,8,11,
%T A277210 11,12,13,16,15,18,20,22,22,27,27,31,33,37,38,45,46,51,55,62,63,72,76,
%U A277210 84,89,99,103,116,122,133,142,158,164,181,193,210,222,245,257,281,299,324,343,376,396,429,457,495,522,568,601,649,689
%N A277210 Expansion of Product_{k>=1} 1/(1 - x^(3*k+1)).
%C A277210 Number of partitions of n into parts larger than 1 and congruent to 1 mod 3.
%C A277210 More generally, the ordinary generating function for the number of partitions of n into parts larger than 1 and congruent to 1 mod m (for m>0) is Product_{k>=1} 1/(1 - x^(m*k+1)).
%H A277210 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A277210 G.f.: Product_{k>=1} 1/(1 - x^(3*k+1)).
%F A277210 a(n) ~ Pi^(1/3) * Gamma(1/3) * exp(sqrt(2*n)*Pi/3) / (2^(13/6)*3^(3/2)*n^(7/6)). - _Vaclav Kotesovec_, Oct 06 2016
%e A277210 a(14) = 2, because we have [10, 4] and [7, 7].
%t A277210 CoefficientList[Series[(1 - x)/QPochhammer[x, x^3], {x, 0, 85}], x]
%Y A277210 Cf. A016777, A035382, A087897, A117957.
%K A277210 nonn
%O A277210 0,15
%A A277210 _Ilya Gutkovskiy_, Oct 05 2016