cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A308992 Sum of the sixth largest parts in the partitions of n into 8 parts.

This page as a plain text file.
%I A308992 #6 Jul 04 2019 20:38:17
%S A308992 0,0,0,0,0,0,0,0,1,1,2,3,5,7,12,17,26,35,50,67,94,123,167,216,285,362,
%T A308992 469,589,749,931,1165,1431,1771,2152,2630,3171,3836,4585,5497,6521,
%U A308992 7753,9134,10775,12615,14784,17202,20030,23182,26837,30897,35581,40769
%N A308992 Sum of the sixth largest parts in the partitions of n into 8 parts.
%H A308992 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308992 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)} m.
%F A308992 a(n) = A308989(n) - A308990(n) - A308991(n) - A308994(n) - A308995(n) - A308996(n) - A308997(n) - A308998(n).
%t A308992 Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[m, {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 A308992 Cf. A026814, A308989, A308990, A308991, A308994, A308995, A308996, A308997, A308998.
%K A308992 nonn
%O A308992 0,11
%A A308992 _Wesley Ivan Hurt_, Jul 04 2019