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.
%I A256288 #11 Apr 27 2023 12:49:57
%S A256288 0,7,210,2205,12208,47845,148638,393617,922600,1970325,3902360,
%T A256288 7270725,12868128,21811881,35617708,56319375,86565808,129780448,
%U A256288 190285326,273509446,386137220,536375658,734131552,991339307,1322171256,1743437850,2274824006,2939374683
%N A256288 Sum of all the parts in the partitions of 7n into 7 parts.
%H A256288 Ray Chandler, <a href="/A256288/b256288.txt">Table of n, a(n) for n = 0..50</a>
%F A256288 a(n) = 7*n*A256287(n).
%e A256288 For n=2 there are 15 partitions of 7*2 = 14, so a(2) = 15*14 = 210.
%t A256288 Plus @@ Total /@ IntegerPartitions[7 #, {7}] & /@ Range[0, 24] (* _Michael De Vlieger_, Mar 21 2015 *)
%o A256288 (PARI) concat(0, vector(35, n, k=0; forpart(p=7*n, k++, , [7,7]); 7*n*k))
%Y A256288 Cf. A235988, A238328, A256235, A256287.
%K A256288 nonn
%O A256288 0,2
%A A256288 _Colin Barker_, Mar 21 2015