|
| |
|
|
A051777
|
|
Triangle read by rows, where row (n) = n mod n, n mod (n-1), n mod (n-2), ...n mod 1.
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,13
|
|
|
COMMENTS
| 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]
Central terms: a(2*n - 1, n) = n - 1. [Reinhard Zumkeller, Jan 25 2011]
|
|
|
LINKS
| Reinhard Zumkeller, Rows n=1..150 of triangle, flattened
|
|
|
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; ...
|
|
|
MATHEMATICA
| Flatten[Table[Mod[n, Range[n, 1, -1]], {n, 20}]] (* From Harvey P. Dale, Nov 30 2011 *)
|
|
|
PROG
| (Haskell)
a051777 n k = a051777_row n !! (k-1)
a051777_row n = map (mod n) [n, n-1 .. 1]
a051777_tabl = map a051777_row [1..]
-- Reinhard Zumkeller, Jan 25 2011
|
|
|
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 * A107628 A152815 A115296
Adjacent sequences: A051774 A051775 A051776 * A051778 A051779 A051780
|
|
|
KEYWORD
| easy,nice,nonn,tabl
|
|
|
AUTHOR
| Asher Auel (asher.auel(AT)reed.edu), Dec 09 1999
|
| |
|
|
