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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309656 Number of odd parts in the partitions of n into 9 parts. 1
 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 8, 16, 22, 37, 48, 75, 96, 140, 180, 249, 316, 429, 536, 703, 876, 1125, 1382, 1746, 2122, 2636, 3184, 3898, 4668, 5662, 6724, 8065, 9522, 11320, 13272, 15660, 18246, 21370, 24770, 28812, 33218, 38425, 44076, 50692, 57900, 66254 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 LINKS FORMULA a(n) = Sum_{q=1..floor(n/9)} Sum_{p=q..floor((n-q)/8)} Sum_{o=p..floor((n-p-q)/7)} Sum_{m=o..floor((n-o-p-q)/6)} Sum_{l=m..floor((n-m-o-p-q)/5)} Sum_{k=l..floor((n-l-m-o-p-q)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q)/2)} (q mod 2) + (p mod 2) + (o mod 2) + (m mod 2) + (l mod 2) + (k mod 2) + (j mod 2) + (i mod 2) + ((n-i-j-k-l-m-o-p-q) mod 2). MATHEMATICA Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Mod[i, 2] + Mod[j, 2] + Mod[k, 2] + Mod[l, 2] + Mod[m, 2] + Mod[o, 2] + Mod[p, 2] + Mod[q, 2] + Mod[n - i - j - k - l - m - o - p - q, 2], {i, j, Floor[(n - j - k - l - m - o - p - q)/2]}], {j, k, Floor[(n - k - l - m - o - p - q)/3]}], {k, l, Floor[(n - l - m - o - p - q)/4]}], {l, m, Floor[(n - m - o - p - q)/5]}], {m, o, Floor[(n - o - p - q)/6]}], {o, p, Floor[(n - p - q)/7]}], {p, q, Floor[(n - q)/8]}], {q, Floor[n/9]}], {n, 0, 50}] CROSSREFS Sequence in context: A137392 A307639 A231483 * A309657 A296615 A340446 Adjacent sequences:  A309653 A309654 A309655 * A309657 A309658 A309659 KEYWORD nonn AUTHOR Wesley Ivan Hurt, Aug 11 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 23 13:59 EDT 2021. Contains 345402 sequences. (Running on oeis4.)