|
|
A138553
|
|
Table read by rows: T(n,k) is the number of divisors of k that are <= n.
|
|
3
|
|
|
1, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 4, 1, 2, 3, 3, 1, 3, 1, 4, 2, 2, 1, 4, 2, 2, 2, 3, 1, 4, 1, 3, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 4, 1, 3, 2, 3, 1, 3, 2, 3, 2, 2, 1, 5, 1, 2, 2, 3, 2, 4, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 1, 4, 1, 4, 2, 2, 1, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The row lengths are the lengths before the pattern for n repeats.
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = sum_{i|k, i<=n} 1.
|
|
EXAMPLE
|
The first few rows start:
1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, [A083040]
|
|
PROG
|
(PARI) lista(nrows) = {for (n=1, nrows, for (k=1, lcm(vector(n, i, i)), print1(sumdiv(k, d, d <=n), ", "); ); print(); ); } \\ Michel Marcus, Jun 19 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|