A339222 - OEIS

A339222

Number of partitions of n into parts >= 2 where every part appears at least 2 times.

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, 26, 86, 39, 105, 61, 139, 70, 191, 100, 230, 144, 304, 173, 400, 235, 490, 326, 629, 395, 819, 525, 996, 701, 1269, 859, 1617, 1114, 1974, 1456, 2475, 1783, 3124, 2279, 3793, 2920

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000

Index entries for sequences related to partitions

FORMULA

G.f.: Product_{k>=2} (1 + x^(2*k) / (1 - x^k)).

a(n) ~ exp(2*Pi*sqrt(n)/3) * Pi / (18*sqrt(2)*n^(3/2)). - Vaclav Kotesovec, Dec 09 2020

EXAMPLE

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].

MATHEMATICA