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!)
A355196 Sum of the largest parts of the partitions of n into exactly 3 prime parts. 3
0, 0, 0, 0, 0, 0, 2, 3, 3, 8, 5, 12, 12, 12, 7, 23, 18, 38, 24, 31, 24, 59, 30, 73, 47, 71, 49, 113, 55, 115, 40, 102, 59, 171, 48, 168, 100, 191, 102, 220, 50, 265, 89, 246, 120, 322, 109, 383, 136, 348, 181, 477, 158, 516, 117, 468, 199, 605, 133, 574, 170, 600, 252, 751, 133 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = Sum_{j=1..floor(n/3)} Sum_{i=j..floor((n-j)/2)} c(i) * c(j) * c(n-i-j) * (n-i-j), where c = A010051.
a(n) = A355199(n) - A355197(n) - A355198(n).
EXAMPLE
a(9) = 8; since 9 can be written as the sum of 3 primes in two ways: 2+2+5 = 3+3+3 and the sum of the largest parts of these partitions is 5+3 = 8, we have a(9) = 8.
MATHEMATICA
Table[Sum[Sum[(n - i - j) (PrimePi[i] - PrimePi[i - 1]) (PrimePi[j] - PrimePi[j - 1]) (PrimePi[n - i - j] - PrimePi[n - i - j - 1]), {i, j, Floor[(n - j)/2]}], {j, Floor[n/3]}], {n, 0, 80}]
CROSSREFS
Sequence in context: A347823 A185297 A329803 * A202818 A256679 A193997
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 23 2022
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 May 2 04:29 EDT 2024. Contains 372178 sequences. (Running on oeis4.)