login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A035459
Number of partitions of n into parts 8k+3 or 8k+4.
1
0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 3, 1, 2, 4, 3, 2, 4, 5, 5, 4, 6, 8, 8, 6, 9, 12, 11, 9, 14, 17, 15, 15, 20, 23, 23, 21, 28, 34, 31, 30, 41, 45, 43, 44, 55, 62, 60, 60, 76, 84, 80, 83, 103, 112, 108, 114, 138, 148, 146, 153, 182, 197, 192, 203, 243, 256, 252, 272, 315, 333
OFFSET
1,11
LINKS
FORMULA
a(n) ~ exp(Pi*sqrt(n/6)) * Gamma(3/8) / (4 * 2^(15/16) * 3^(3/16) * Pi^(5/8) * n^(11/16)). - Vaclav Kotesovec, Aug 26 2015
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Product[1/((1 - x^(8k+3))*(1 - x^(8k+4))), {k, 0, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Aug 26 2015 *)
nmax = 60; kmax = nmax/8;
s = Flatten[{Range[0, kmax]*8 + 3}~Join~{Range[0, kmax]*8 + 4}];
Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 1, nmax}] (* Robert Price, Aug 04 2020 *)
CROSSREFS
Cf. A035690.
Sequence in context: A256990 A071503 A029271 * A048232 A163256 A199263
KEYWORD
nonn
STATUS
approved