login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035443 Number of partitions of n into parts 8k or 8k+3. 1
0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 2, 1, 2, 2, 1, 4, 2, 1, 5, 2, 4, 5, 2, 8, 5, 2, 10, 5, 7, 11, 5, 14, 11, 5, 19, 11, 12, 21, 11, 24, 22, 11, 33, 22, 22, 38, 22, 41, 40, 22, 58, 41, 37, 68, 41, 67, 73, 41, 95, 75, 63, 114, 76, 108, 124, 76, 155, 129, 106, 188, 131, 173 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

LINKS

Robert Price, Table of n, a(n) for n = 1..1000

FORMULA

a(n) ~ exp(Pi*sqrt(n/6)) * Gamma(3/8) / (4 * 2^(3/16) * 3^(7/16) * Pi^(5/8) * n^(15/16)). - Vaclav Kotesovec, Aug 26 2015

MATHEMATICA

nmax = 100; Rest[CoefficientList[Series[Product[1/((1 - x^(8k+8))*(1 - x^(8k+3))), {k, 0, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Aug 26 2015 *)

nmax = 50; kmax = nmax/8;

s = Flatten[{Range[0, kmax]*8}~Join~{Range[0, kmax]*8 + 3}];

Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 1, nmax}] (* Robert Price, Aug 03 2020 *)

CROSSREFS

Cf. A035674.

Sequence in context: A287108 A333948 A287360 * A180430 A246369 A036261

Adjacent sequences:  A035440 A035441 A035442 * A035444 A035445 A035446

KEYWORD

nonn

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 09:10 EST 2021. Contains 349484 sequences. (Running on oeis4.)