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.

A308927 Sum of the smallest parts in the partitions of n into 7 parts.

This page as a plain text file.
%I A308927 #9 Mar 17 2025 04:01:42
%S A308927 0,0,0,0,0,0,0,1,1,2,3,5,7,11,16,22,30,41,54,72,93,121,153,194,242,
%T A308927 302,372,457,557,675,812,975,1162,1381,1632,1924,2254,2636,3068,3562,
%U A308927 4119,4752,5463,6265,7162,8170,9293,10549,11942,13496,15211,17115,19214
%N A308927 Sum of the smallest parts in the partitions of n into 7 parts.
%H A308927 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308927 a(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)} o.
%F A308927 a(n) = A308926(n) - A308928(n) - A308929(n) - A308930(n) - A308931(n) - A308932(n) - A308933(n).
%t A308927 Table[Sum[Sum[Sum[Sum[Sum[Sum[o, {i, j, Floor[(n - j - k - l - m - o)/2]}], {j, k, Floor[(n - k - l - m - o)/3]}], {k, l, Floor[(n - l - m - o)/4]}], {l, m, Floor[(n - m - o)/5]}], {m, o, Floor[(n - o)/6]}], {o, Floor[n/7]}], {n, 0, 50}]
%Y A308927 Cf. A026813, A308926, A308928, A308929, A308930, A308931, A308932, A308933.
%K A308927 nonn
%O A308927 0,10
%A A308927 _Wesley Ivan Hurt_, Jun 30 2019