[go: up one dir, main page]

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!)
A355199 Sum of all the parts in the partitions of n into exactly 3 prime parts. 3
0, 0, 0, 0, 0, 0, 6, 7, 8, 18, 10, 22, 24, 26, 14, 45, 32, 68, 36, 57, 40, 105, 44, 115, 72, 125, 78, 189, 84, 203, 60, 186, 96, 297, 68, 280, 144, 333, 152, 390, 80, 451, 126, 430, 176, 540, 138, 611, 192, 588, 250, 765, 208, 848, 162, 770, 280, 969, 174, 944, 240, 976, 372 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = n * Sum_{j=1..floor(n/3)} Sum_{i=j..floor((n-j)/2)} c(i) * c(j) * c(n-i-j), where c = A010051.
a(n) = n * A068307(n) for n > 0.
a(n) = A355196(n) + A355197(n) + A355198(n).
EXAMPLE
a(9) = 18; since 9 can be written as the sum of 3 primes in two ways: 2+2+5 = 3+3+3 and the sum of all the parts of these partitions is (2+2+5)+(3+3+3) = 18, we have a(9) = 18.
MATHEMATICA
Table[n*Sum[Sum[(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: A155150 A078745 A087663 * A358557 A112813 A347808
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 August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)