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!)
A308919 Sum of all the parts in the partitions of n into 6 primes. 6
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 13, 14, 30, 32, 51, 72, 57, 80, 105, 132, 138, 192, 175, 260, 270, 336, 319, 480, 372, 608, 561, 748, 630, 936, 740, 1178, 936, 1320, 1107, 1764, 1247, 2068, 1575, 2346, 1786, 2880, 2009, 3400, 2397, 3796, 2809, 4644 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,13
LINKS
FORMULA
a(n) = 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)} c(m) * c(l) * c(k) * c(j) * c(i) * c(n-i-k-j-l-m), where c = A010051.
a(n) = n * A259196(n).
a(n) = A308920(n) + A308921(n) + A308922(n) + A308923(n) + A308924(n) + A308925(n).
MATHEMATICA
Table[n*Sum[Sum[Sum[Sum[Sum[(PrimePi[i] - PrimePi[i - 1]) (PrimePi[j] - PrimePi[j - 1]) (PrimePi[k] - PrimePi[k - 1]) (PrimePi[l] - PrimePi[l - 1]) (PrimePi[m] - PrimePi[m - 1]) (PrimePi[n - i - j - k - l - m] - PrimePi[n - i - j - k - l - m - 1]), {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, 50}]
CROSSREFS
Sequence in context: A257073 A239722 A112655 * A048026 A115662 A354746
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 30 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 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)