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.

A308926 Sum of all the parts in the partitions of n into 7 parts.

This page as a plain text file.
%I A308926 #15 Jul 31 2025 14:35:49
%S A308926 0,0,0,0,0,0,0,7,8,18,30,55,84,143,210,315,448,646,882,1235,1640,2205,
%T A308926 2882,3772,4824,6200,7800,9828,12208,15138,18540,22723,27520,33297,
%U A308926 39950,47845,56844,67488,79534,93600,109520,127920,148638,172473,199144,229590
%N A308926 Sum of all the parts in the partitions of n into 7 parts.
%H A308926 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308926 a(n) = n * Sum_{o=1..floor(n/7)} Sum_{m=o..floor((n-o)/6)} Sum_{l=m..floor((n-m-o)/5)} Sum_{k=l..floor((n-l-m-o)/4)} Sum_{j=k..floor((n-k-l-m-o)/3)} Sum_{i=j..floor((n-j-k-l-m-o)/2)} 1.
%F A308926 a(n) = n * A026813(n).
%F A308926 a(n) = A308927(n) + A308928(n) + A308929(n) + A308930(n) + A308931(n) + A308932(n) + A308933(n).
%t A308926 Table[Total[Flatten[IntegerPartitions[n,{7}]]],{n,0,50}] (* _Harvey P. Dale_, Jul 27 2025 *)
%Y A308926 Cf. A026813, A308927, A308928, A308929, A308930, A308931, A308932, A308933.
%K A308926 nonn
%O A308926 0,8
%A A308926 _Wesley Ivan Hurt_, Jun 30 2019