A097093 Number of partitions of n such that the least part occurs exactly five times.

0, 0, 0, 0, 1, 0, 1, 1, 2, 3, 4, 4, 8, 9, 14, 16, 23, 27, 39, 48, 62, 76, 100, 120, 159, 190, 241, 292, 367, 443, 552, 663, 816, 980, 1200, 1430, 1742, 2075, 2504, 2979, 3575, 4232, 5063, 5980, 7114, 8382, 9930, 11663, 13773, 16140, 18980, 22190, 26017

Offset

1,9

Links

Table of n, a(n) for n=1..53.

Formula

G.f.: Sum_{m>0} (x^(5*m) / Product_{i>m} (1-x^i)). More generally, g.f. for number of partitions of n such that the least part occurs exactly k times is Sum_{m>0} (x^(k*m) / Product_{i>m} (1-x^i)). Vladeta Jovovic

Mathematica

f[n_] := Block[{p = IntegerPartitions[n], l = PartitionsP[n], c = 0, k = 1}, While[k < l + 1, q = PadLeft[ p[[k]], 6]; If[ q[[1]] != q[[6]] && q[[2]] == q[[6]], c++ ]; k++ ]; c]; Table[ f[n], {n, 54}]
Table[Count[IntegerPartitions[n], _?(Length[Split[#][[-1]]]==5&)], {n, 60}] (* Harvey P. Dale, Feb 07 2022 *)

Crossrefs

Cf. A002865, A096373, A097091, A097092.

Sequence in context: A344680 A330147 A241037 * A056877 A267232 A269606

Adjacent sequences: A097090 A097091 A097092 * A097094 A097095 A097096

Keyword

nonn

Author

Robert G. Wilson v, Jul 24 2004

Status

approved