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!)
A309468 Sum of the prime parts in the partitions of n into 7 parts. 7
0, 0, 0, 0, 0, 0, 0, 0, 2, 7, 11, 28, 41, 79, 115, 175, 238, 357, 464, 670, 851, 1145, 1441, 1908, 2349, 3034, 3698, 4657, 5635, 7007, 8350, 10240, 12124, 14609, 17192, 20549, 23920, 28326, 32802, 38437, 44287, 51520, 58934, 68170, 77621, 89049, 100981 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
a(n) = Sum_{o=1..floor(n/7)} Sum_{m=o..floor((n-o)/6)} Sum_{l=m..floor((n-m-o)/5)} Sum_{k=l..floor((n-l-m-o)/4)} Sum_{j=k..floor((n-k-l-m-o)/3)} Sum_{i=j..floor((n-j-k-l-m-o)/2)} (i * c(i) + j * c(j) + k * c(k) + l * c(l) + m * c(m) + o * c(o) + (n-i-j-k-l-m-o) * c(n-i-j-k-l-m-o)), where c = A010051.
MATHEMATICA
Table[Sum[Sum[Sum[Sum[Sum[Sum[i (PrimePi[i] - PrimePi[i - 1]) + j (PrimePi[j] - PrimePi[j - 1]) + k (PrimePi[k] - PrimePi[k - 1]) + l (PrimePi[l] - PrimePi[l - 1]) + m (PrimePi[m] - PrimePi[m - 1]) + o (PrimePi[o] - PrimePi[o - 1]) + (n - i - j - k - l - m - o) (PrimePi[n - i - j - k - l - m - o] - PrimePi[n - i - j - k - l - m - o - 1]), {i, j, Floor[(n - j - k - l - m - o)/2]}], {j, k, Floor[(n - k - l - m - o)/3]}], {k, l, Floor[(n - l - m - o)/4]}], {l, m, Floor[(n - m - o)/5]}], {m, o, Floor[(n - o)/6]}], {o, Floor[n/7]}], {n, 0, 80}]
CROSSREFS
Sequence in context: A309465 A309466 A309467 * A309469 A309470 A309471
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Aug 03 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 06:16 EDT 2024. Contains 371782 sequences. (Running on oeis4.)