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!)
A309550 Sum of the odd parts in the partitions of n into 6 parts. 0
0, 0, 0, 0, 0, 0, 6, 5, 12, 15, 32, 39, 72, 92, 156, 198, 300, 380, 556, 683, 936, 1162, 1550, 1887, 2448, 2957, 3758, 4495, 5572, 6614, 8122, 9528, 11496, 13435, 16026, 18563, 21924, 25244, 29548, 33821, 39212, 44650, 51464, 58244, 66616, 75123, 85440 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = Sum_{m=1..floor(n/6)} Sum_{l=m..floor((n-m)/5)} Sum_{k=l..floor((n-l-m)/4)} Sum_{j=k..floor((n-k-l-m)/3)} Sum_(i=j..floor((n-j-k-l-m)/2)} (i * (i mod 2) + j * (j mod 2) + k * (k mod 2) + l * (l mod 2) + m * (m mod 2) + (n-i-j-k-l-m) * ((n-i-j-k-l-m) mod 2)).
MATHEMATICA
Table[Sum[Sum[Sum[Sum[Sum[i * Mod[i, 2] + j * Mod[j, 2] + k * Mod[k, 2] + l * Mod[l, 2] + m * Mod[m, 2] + (n - i - j - k - l - m) * Mod[n - i - j - k - l - m, 2], {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 100}]
CROSSREFS
Sequence in context: A046615 A103132 A046627 * A274931 A120114 A123168
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Aug 07 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 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)