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 A210956 #17 Feb 19 2020 20:13:16 %S A210956 1,1,3,2,2,5,3,7,7,11,5,7,10,10,15,7,15,21,25,25,31,11,17,23,27,32,32, %T A210956 39,15,31,40,52,57,63,63,71,22,36,54,62,72,78,85,85,94,30,60,78,98, %U A210956 113,125,132,140,140,150,42,72,102,122,142,154,168,176,185,185,196 %N A210956 Triangle read by rows: T(n,k) = sum of all parts <= k in the last section of the set of partitions of n. %C A210956 Row n lists the partial sums of row n of triangle A207383. %H A210956 Andrew Howroyd, <a href="/A210956/b210956.txt">Table of n, a(n) for n = 1..1275</a> %F A210956 T(n,k) = Sum_{j=1..k} A207383(n,j). %e A210956 Triangle begins: %e A210956 1; %e A210956 1, 3; %e A210956 2, 2, 5; %e A210956 3, 7, 7, 11; %e A210956 5, 7, 10, 10, 15; %e A210956 7, 15, 21, 25, 25, 31; %e A210956 11, 17, 23, 27, 32, 32, 39; %e A210956 15, 31, 40, 52, 57, 63, 63, 71; %e A210956 22, 36, 54, 62, 72, 78, 85, 85, 94; %o A210956 (PARI) Row(n)={my(v=vector(n)); v[1]=numbpart(n-1); if(n>1, forpart(p=n, for(k=1, #p, v[p[k]]++), [2,n])); for(k=2, n, v[k]=v[k-1]+k*v[k]); v} %o A210956 { for(n=1, 10, print(Row(n))) } %Y A210956 Column 1 is A000041. Right border gives A138879. %Y A210956 Cf. A135010, A138121, A182703, A206437, A206562, A207031, A207032, 207383, 208476, A210948, A210955. %K A210956 nonn,tabl %O A210956 1,3 %A A210956 _Omar E. Pol_, May 01 2012 %E A210956 Terms a(46) and beyond from _Andrew Howroyd_, Feb 19 2020