|
Search: id:A077049
|
|
|
| A077049 |
|
Left summatory matrix, T, by antidiagonals. |
|
+0
9
|
|
| 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
If S=(s(1),s(2),...) is a sequence written as a column vector, then T*S is the summatory sequence of S; i.e. its n-th term is Sum{s(k): k|n}. T is the inverse of the left Moebius transformation matrix, A077050. Except for the first term in some cases, Column 1 of T^(-2) is A007427, Column 1 of T^(-1) is A008683, Column 1 of T^2 is A000005, Column 1 of T^3 is A007425.
This is essentially the same as A051731, which includes only the triangle. Note that the standard in the OEIS is left to right antidiagonals, which would make this the right summatory matrix, and A077051 the left one. [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 08 2009]
|
|
LINKS
|
C. Kimberling, Matrix Transformations of Integer Sequences, J. Integer Seqs., Vol. 6, 2003.
|
|
FORMULA
|
T(n, k)=1 if k|n, else T(n, k)=0, k>=1, n>=1.
|
|
EXAMPLE
|
T(4,2)=1 since 2 divides 4. Northwest corner:
1 0 0 0 0 0
1 1 0 0 0 0
1 0 1 0 0 0
1 1 0 1 0 0
1 0 0 0 1 0
1 1 1 0 0 1
|
|
CROSSREFS
|
Cf. A077050, A077051, A077052.
Sequence in context: A014577 A157926 A131377 this_sequence A124895 A089885 A143242
Adjacent sequences: A077046 A077047 A077048 this_sequence A077050 A077051 A077052
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Oct 22 2002
|
|
|
Search completed in 0.002 seconds
|
