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!)
A309628 Number of odd parts in the partitions of n into 8 parts. 1
0, 0, 0, 0, 0, 0, 0, 0, 8, 7, 14, 19, 32, 41, 64, 81, 118, 151, 208, 262, 354, 439, 572, 706, 900, 1094, 1368, 1650, 2032, 2431, 2950, 3500, 4206, 4950, 5882, 6879, 8104, 9412, 11000, 12699, 14736, 16920, 19500, 22276, 25530, 29020, 33072, 37432, 42450 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
a(n) = Sum_{p=1..floor(n/8)} Sum_{o=p..floor((n-p)/7)} Sum_{m=o..floor((n-o-p)/6)} Sum_{l=m..floor((n-m-o-p)/5)} Sum_{k=l..floor((n-l-m-o-p)/4)} Sum_{j=k..floor((n-k-l-m-o-p)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p)/2)} (i mod 2) + (j mod 2) + (k mod 2) + (l mod 2) + (m mod 2) + (o mod 2) + (p mod 2) + ((n-i-j-k-l-m-o-p) mod 2).
MATHEMATICA
Table[Count[Flatten[IntegerPartitions[n, {8}]], _?(OddQ[#]&)], {n, 0, 50}] (* Harvey P. Dale, Jul 31 2021 *)
CROSSREFS
Sequence in context: A277915 A051011 A298666 * A303716 A309629 A075573
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Aug 10 2019
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 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)