Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077605 Left summing matrix, S. +0
2
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; listen)
OFFSET

1,1

COMMENT

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: A014555 A145575 A071035 this_sequence A014672 A015335 A014906

Adjacent sequences: A077602 A077603 A077604 this_sequence A077606 A077607 A077608

KEYWORD

easy,nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Nov 11 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research