cp's OEIS Frontend

A027189 Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.

%I A027189 #14 May 15 2023 11:13:31
%S A027189 0,0,1,0,0,0,0,0,1,1,2,2,3,3,5,5,7,8,11,12,17,19,25,29,37,43,56,64,80,
%T A027189 94,116,135,167,194,236,276,332,387,466,541,645,752,891,1034,1223,
%U A027189 1417,1666,1931,2260,2613,3054,3522,4098,4725,5480
%N A027189 Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.
%H A027189 Vaclav Kotesovec, <a href="/A027189/b027189.txt">Table of n, a(n) for n = 1..10000</a>
%F A027189 a(n) ~ Pi^2 * exp(Pi*sqrt(2*n/3)) / (8 * 3^(3/2) * n^2). - _Vaclav Kotesovec_, May 17 2020
%F A027189 G.f.: x^3 * Sum_{k>=0} x^(6*k)/Product_{j=1..2*k} (1-x^j). - _Seiichi Manyama_, May 15 2023
%Y A027189 Cf. A027195.
%K A027189 nonn
%O A027189 1,11
%A A027189 _Clark Kimberling_