Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Oct 10 2021 06:48:54
%S 1,1,0,1,1,0,1,1,0,0,1,1,1,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,
%T 0,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,1,1,
%U 1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0
%N Left summing matrix, S.
%C If v is a sequence written as a column vector, then Sv is the sequence of partial sums of v. The inverse of S is the left differencing matrix; the transpose of S is the right summing matrix.
%H Clark Kimberling, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Kimberling/kimberling24.html">Matrix Transformations of Integer Sequences</a>, J. Integer Seqs., Vol. 6, 2003.
%F S(n, k)=1 if 1<=k<=n, else S(n, k)=0.
%e Northwest corner:
%e 1 0 0 0 0
%e 1 1 0 0 0
%e 1 1 1 0 0
%e 1 1 1 1 0
%e 1 1 1 1 1
%Y Cf. A077606 (matrix inverse), A101688 (transpose).
%K easy,nonn,tabl
%O 1,1
%A _Clark Kimberling_, Nov 11 2002