cp's OEIS Frontend

A035360 Number of partitions of n into parts 3k or 3k+1.

%I A035360 #24 Aug 03 2020 01:34:00
%S A035360 1,1,1,2,3,3,5,7,8,11,15,17,23,30,35,44,57,66,82,103,121,146,181,211,
%T A035360 253,308,360,425,513,596,700,834,969,1127,1333,1541,1786,2093,2415,
%U A035360 2781,3241,3723,4273,4946,5669,6476,7461,8519,9705,11123,12669,14379,16418
%N A035360 Number of partitions of n into parts 3k or 3k+1.
%C A035360 Euler transform of period 3 sequence [ 1, 0, 1, ...]. - _Kevin T. Acres_, Apr 28 2018
%H A035360 Robert Price, <a href="/A035360/b035360.txt">Table of n, a(n) for n = 0..1000</a>
%F A035360 a(n) ~ Gamma(1/3) * exp(2*Pi*sqrt(n)/3) / (4 * sqrt(3) * Pi^(2/3) * n^(11/12)). - _Vaclav Kotesovec_, Aug 23 2015
%e A035360 1 + x + x^2 + 2*x^3 + 3*x^4 + 3*x^5 + 5*x^6 + 7*x^7 + 8*x^8 + 11*x^9 + ...
%t A035360 nmax = 50; CoefficientList[Series[Product[1/((1 - x^(3*k))*(1 - x^(3*k-2))), {k, 1, nmax}], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Aug 23 2015 *)
%t A035360 nmax = 52; kmax = nmax/3;
%t A035360 s = Flatten[{Range[0, kmax]*3}~Join~{Range[0, kmax]*3 + 1}];
%t A035360 Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 0, nmax}] (* _Robert Price_, Aug 02 2020 *)
%Y A035360 Cf. A032766, A132463, A000726, A035361.
%K A035360 nonn
%O A035360 0,4
%A A035360 _Olivier Gérard_