|
Search: id:A084934
|
|
|
| A084934 |
|
Rectangular array T(m,n) (m>=1, n>=1) read by antidiagonals: row m consists of the numbers ( i + mj : i >= 0, j >= 0 ), sorted in increasing order, with repetitions allowed. |
|
+0
2
|
|
| 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 2, 2, 2, 1, 0, 2, 3, 3, 2, 1, 0, 3, 3, 3, 3, 2, 1, 0, 3, 4, 4, 4, 3, 2, 1, 0, 3, 4, 4, 4, 4, 3, 2, 1, 0, 3, 4, 5, 5, 5, 4, 3, 2, 1, 0, 4, 5, 5, 5, 5, 5, 4, 3, 2, 1, 0, 4, 5, 6, 6, 6, 6, 5, 4, 3, 2, 1, 0, 4, 5, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 0, 4, 6, 6, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
The combinatorial limit of the rows is the sequence of nonnegative integers.
|
|
FORMULA
|
For k>=0, the number of k's in row m is [(k+1)/m].
|
|
EXAMPLE
|
The northwest corner includes
m\n 1 2 3 4 5 6 7 8 9 10 ...
----------------------------
1 | 0 1 1 2 2 2 3 3 3 3 ...
2 | 0 1 2 2 3 3 4 4 4 5 ...
3 | 0 1 2 3 3 4 4 5 5 6 ...
4 | 0 1 2 3 4 4 5 5 6 6 ...
5 | 0 1 2 3 4 5 5 6 6 7 ...
Row m=0, for example, consists of the numbers i+j (i>=0, j>=0), sorted.
|
|
CROSSREFS
|
Cf. A010766, A084934.
Sequence in context: A141647 A001617 A143667 this_sequence A125927 A092869 A029337
Adjacent sequences: A084931 A084932 A084933 this_sequence A084935 A084936 A084937
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Jun 12 2003
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), May 19 2007
|
|
|
Search completed in 0.002 seconds
|
