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 A220075 #9 Sep 27 2021 07:58:20 %S A220075 1,1,3,2,3,6,3,4,6,10,4,6,7,10,15,5,8,9,11,15,21,6,10,12,13,16,21,28, %T A220075 7,12,15,16,18,22,28,36,8,14,18,20,21,24,29,36,45,9,16,21,24,25,27,31, %U A220075 37,45,55,10,18,24,28,30,31,34,39,46,55,66,11,20,27 %N A220075 Partial sums in rows of A220073, triangle read by rows. %C A220075 T(n,k) = sum(A220073(n,i): i=1..k). %H A220075 Reinhard Zumkeller, <a href="/A220075/b220075.txt">Table of n, a(n) for n = 1..7260</a> %t A220075 A[n_, k_] := If[k == 1, n, If[k == n, n-1, Abs[2k-n-If[2k <= n+1, 2, 1]]]]; %t A220075 A220073[n_, k_] := A[n, n-k+1]; %t A220075 T[n_, k_] := Sum[A220073[n, i], {i, 1, k}]; %t A220075 Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Sep 27 2021 *) %o A220075 (Haskell) %o A220075 a220075 n k = a220075_tabl !! (n-1) !! (k-1) %o A220075 a220075_row n = a220075_tabl !! (n-1) %o A220075 a220075_tabl = map (scanl1 (+)) a220073_tabl %Y A220075 Cf. A000027 (left edge), A000217 (right edge), A002061 (central terms), A019298 (row sums); A220053. %K A220075 nonn,tabl %O A220075 1,3 %A A220075 _Reinhard Zumkeller_, Dec 03 2012