|
Search: id:A051777
|
|
|
| A051777 |
|
Triangle read by rows, where row (n) = n mod n, n mod (n-1), n mod (n-2), ...n mod 1. |
|
+0
3
|
|
| 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 1, 2, 0, 0, 0, 0, 1, 2, 3, 1, 1, 0, 0, 1, 2, 3, 0, 2, 0, 0, 0, 1, 2, 3, 4, 1, 0, 1, 0, 0, 1, 2, 3, 4, 0, 2, 1, 0, 0, 0, 1, 2, 3, 4, 5, 1, 3, 2, 1, 0, 0, 1, 2, 3, 4, 5, 0, 2, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 1, 3, 1, 1, 1, 0, 0, 1, 2, 3, 4, 5, 6, 0, 2, 4, 2, 2, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,13
|
|
|
COMMENT
|
Also, rectangular array read by antidiagonals, a(n, k) = k mod n (k >= 0, n >= 1). Cf. A048158, A051127. [From David Wasserman (dwasserm(AT)earthlink.net), Oct 01 2008]
|
|
EXAMPLE
|
row (5) = 5 mod 5, 5 mod 4, 5 mod 3, 5 mod 2, 5 mod 1 = 0, 1, 2, 1, 0 0; 0,0; 0,1,0; 0,1,0,0; 0,1,2,1,0; 0,1,2,0,0,0; ...
|
|
CROSSREFS
|
Cf. A051778. Row sums give A004125. Number of 0's in row n gives A000005 (tau(n)). Number of 1's in row n+1 gives A032741(n).
Sequence in context: A136567 A109708 A035468 this_sequence A107628 A152815 A115296
Adjacent sequences: A051774 A051775 A051776 this_sequence A051778 A051779 A051780
|
|
KEYWORD
|
easy,nice,nonn,tabl
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu), Dec 09 1999
|
|
|
Search completed in 0.002 seconds
|
