|
Search: id:A051127
|
|
|
| A051127 |
|
Table T(n,k) = k mod n read by antidiagonals (n >= 1, k >= 1). |
|
+0
6
|
|
| 0, 0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 2, 1, 0, 1, 1, 3, 2, 1, 0, 0, 2, 0, 3, 2, 1, 0, 1, 0, 1, 4, 3, 2, 1, 0, 0, 1, 2, 0, 4, 3, 2, 1, 0, 1, 2, 3, 1, 5, 4, 3, 2, 1, 0, 0, 0, 0, 2, 0, 5, 4, 3, 2, 1, 0, 1, 1, 1, 3, 1, 6, 5, 4, 3, 2, 1, 0, 0, 2, 2, 4, 2, 0, 6, 5, 4, 3, 2, 1, 0, 1, 0, 3, 0, 3, 1, 7, 6, 5, 4, 3, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
COMMENT
|
Note that the upper right half of this sequence when formatted as a square array is essentially the same as this whole sequence when formatted as an upper right triangle. Sums of antidiagonals are A004125. - Henry Bottomley (se16(AT)btinternet.com), Jun 22 2001
Row sums are: {0, 1, 1, 4, 3, 8, 8, 12, 13, 22, 17, ...}. - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 04 2008
|
|
FORMULA
|
t(n,m)=Mod[n - m + 1, m + 1]. - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 04 2008
|
|
MATHEMATICA
|
Clear[T, n, m]; T[n_, m_] = Mod[n - m + 1, m + 1]; Table[Table[T[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%] - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 04 2008
|
|
CROSSREFS
|
Transpose of A051126.
Cf. A048158.
Cf. A122750.
Sequence in context: A091006 A167365 A025894 this_sequence A070176 A092606 A073253
Adjacent sequences: A051124 A051125 A051126 this_sequence A051128 A051129 A051130
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 11 1999
|
|
|
Search completed in 0.002 seconds
|
