|
Search: id:A075993
|
|
|
| A075993 |
|
Triangular array T(n,m) = number of integers k such that Floor(n/k)=m. Row n has n terms, for n=1,2,3,... |
|
+0
2
|
|
| 1, 1, 1, 2, 0, 1, 2, 1, 0, 1, 3, 1, 0, 0, 1, 3, 1, 1, 0, 0, 1, 4, 1, 1, 0, 0, 0, 1, 4, 2, 0, 1, 0, 0, 0, 1, 5, 1, 1, 1, 0, 0, 0, 0, 1, 5, 2, 1, 0, 1, 0, 0, 0, 0, 1, 6, 2, 1, 0, 1, 0, 0, 0, 0, 0, 1, 6, 2, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 7, 2, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 7, 3, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The sum of numbers in row n is n.
Number of terms > 0 per row: Sum(A063524(T(n,k)):1<=k<=n} = A055086(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 06 2006
|
|
FORMULA
|
T(n, m)=Floor(n/m)-Floor(n/(m+1)).
|
|
EXAMPLE
|
T(5, 1) = 3 counts k such that Floor(5/k) = 1, namely k = 5, 4, 3. First 6 rows:
1
1 1
2 0 1
2 1 0 1
3 1 0 0 1
3 1 1 0 0 1
|
|
CROSSREFS
|
Columns 1, 2, 3 are essentially A004526, A008615, A008679.
Adjacent sequences: A075990 A075991 A075992 this_sequence A075994 A075995 A075996
Sequence in context: A021501 A101662 A091064 this_sequence A117170 A117466 A136266
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Sep 28 2002
|
|
|
Search completed in 0.002 seconds
|
