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!)
A326463 Sum of the largest parts of the partitions of n into 8 primes. 8

%I #7 Nov 18 2021 15:00:22

%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,3,8,8,15,20,20,27,40,47,62,78,73,

%T 104,132,152,172,223,211,298,324,387,394,509,470,640,645,775,756,1015,

%U 916,1265,1146,1445,1403,1852,1576,2200,1953,2565,2330,3143

%N Sum of the largest parts of the partitions of n into 8 primes.

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = Sum_{p=1..floor(n/8)} Sum_{o=p..floor((n-p)/7)} Sum_{m=o..floor((n-o-p)/6)} Sum_{l=m..floor((n-m-o-p)/5)} Sum_{k=l..floor((n-l-m-o-p)/4)} Sum_{j=k..floor((n-k-l-m-o-p)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p)/2)} c(p) * c(o) * c(m) * c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l-m-o-p) * (n-i-j-k-l-m-o-p), where c = A010051.

%F a(n) = A326455(n) - A326456(n) - A326457(n) - A326458(n) - A326459(n) - A326460(n) - A326461(n) - A326462(n).

%t Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[(n-i-j-k-l-m-o-p) * (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[o] - PrimePi[o - 1]) (PrimePi[p] - PrimePi[p - 1]) (PrimePi[n - i - j - k - l - m - o - p] - PrimePi[n - i - j - k - l - m - o - p - 1]), {i, j, Floor[(n - j - k - l - m - o - p)/2]}], {j, k, Floor[(n - k - l - m - o - p)/3]}], {k, l, Floor[(n - l - m - o - p)/4]}], {l, m, Floor[(n - m - o - p)/5]}], {m, o, Floor[(n - o - p)/6]}], {o, p, Floor[(n - p)/7]}], {p, Floor[n/8]}], {n, 0, 50}]

%Y Cf. A010051, A259198, A326455, A326456, A326457, A326458, A326459, A326460, A326461, A326462.

%K nonn

%O 0,17

%A _Wesley Ivan Hurt_, Jul 06 2019

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 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)