|
Search: id:A140224
|
|
|
| A140224 |
|
Triangle: T(n,m) is number of m's among (d(1),d(2),...,d(n)), where d(n) = A000005(n). |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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
|
Cf. A000005, A140223, A140225.
Sequence in context: A101662 A091064 A158948 this_sequence A075993 A117170 A117466
Adjacent sequences: A140221 A140222 A140223 this_sequence A140225 A140226 A140227
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Leroy Quet, May 12 2008
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 26 2009
|
|
|
Search completed in 0.002 seconds
|
