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!)
A308857 Sum of the third largest parts in the partitions of n into 5 primes. 5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 5, 5, 8, 7, 9, 8, 16, 12, 21, 20, 27, 20, 41, 27, 46, 34, 54, 44, 78, 44, 86, 59, 104, 65, 129, 79, 152, 96, 175, 115, 221, 117, 249, 157, 295, 170, 342, 179, 394, 214, 430, 243, 517, 245, 584, 307, 643, 332, 730, 352 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
LINKS
FORMULA
a(n) = Sum_{l=1..floor(n/5)} Sum_{k=l..floor((n-l)/4)} Sum_{j=k..floor((n-k-l)/3)} Sum_{i=j..floor((n-j-k-l)/2)} c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l) * j, where c = A010051.
a(n) = A308854(n) - A308855(n) - A308856(n) - A308858(n) - A308859(n).
MATHEMATICA
Table[Total[Select[IntegerPartitions[n, {5}], AllTrue[#, PrimeQ]&][[All, 3]]], {n, 0, 70}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Sep 06 2020 *)
CROSSREFS
Sequence in context: A240500 A344264 A308512 * A244480 A308923 A308979
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 28 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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)