login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035442 Number of partitions of n into parts 8k or 8k+2. 1
0, 1, 0, 1, 0, 1, 0, 2, 0, 3, 0, 3, 0, 3, 0, 5, 0, 7, 0, 8, 0, 8, 0, 11, 0, 15, 0, 17, 0, 18, 0, 23, 0, 30, 0, 35, 0, 37, 0, 45, 0, 57, 0, 66, 0, 71, 0, 84, 0, 104, 0, 121, 0, 131, 0, 151, 0, 183, 0, 212, 0, 231, 0, 263, 0, 313, 0, 362, 0, 396, 0, 446, 0, 523, 0, 601, 0, 660, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
If n is even, a(n) ~ 2 * exp(Pi*sqrt(n/6)) * Gamma(5/4) / (6^(3/8) * Pi^(3/4) * n^(7/8)). - Vaclav Kotesovec, Aug 26 2015
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Product[1/((1 - x^(8k+8))*(1 - x^(8k+2))), {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 + 2}];
Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 1, nmax}] (* Robert Price, Aug 03 2020 *)
CROSSREFS
Cf. A035679.
Sequence in context: A243982 A214000 A161123 * A213177 A265017 A349136
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)