|
|
A140224
|
|
Triangle: T(n,m) is number of m's among (d(1),d(2),...,d(n)), where d(n) = A000005(n).
|
|
2
|
|
|
1, 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, 1, 2, 0, 0, 0, 0, 1, 4, 2, 2, 0, 0, 0, 0, 0, 1, 4, 2, 3, 0, 0, 0, 0, 0, 0, 1, 5, 2, 3, 0, 0, 0, 0, 0, 0, 0, 1, 5, 2, 3, 0, 1, 0, 0, 0, 0, 0, 0, 1, 6, 2, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 6, 2, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
EXAMPLE
|
The sequence of the numbers of divisors of the first 12 positive integers is: 1,2,2,3,2,4,2,4,3,4,2,6.
There is one 1 in this list, five 2's, two 3's, three 4's, zero 5's, one 6 and zero of any other positive integer. So row 12 of the triangle is: 1,5,2,3,0,1,0,0,0,0,0,0.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|