This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077605 Left summing matrix, S. 1
 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, 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, 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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. LINKS C. Kimberling, Matrix Transformations of Integer Sequences, J. Integer Seqs., Vol. 6, 2003. FORMULA S(n, k)=1 if 1<=k<=n, else S(n, k)=0. EXAMPLE Northwest corner: 1 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 CROSSREFS Cf. A077606. Sequence in context: A286755 A286349 A145575 * A014672 A015335 A014906 Adjacent sequences:  A077602 A077603 A077604 * A077606 A077607 A077608 KEYWORD easy,nonn,tabl AUTHOR Clark Kimberling, Nov 11 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)