|
Search: id:A010766
|
|
|
| A010766 |
|
Triangle of numbers [ n/k ], k=1..n. |
|
+0
25
|
|
| 1, 2, 1, 3, 1, 1, 4, 2, 1, 1, 5, 2, 1, 1, 1, 6, 3, 2, 1, 1, 1, 7, 3, 2, 1, 1, 1, 1, 8, 4, 2, 2, 1, 1, 1, 1, 9, 4, 3, 2, 1, 1, 1, 1, 1, 10, 5, 3, 2, 2, 1, 1, 1, 1, 1, 11, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 12, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 13, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Number of times k occurs as divisor of numbers not greater than n. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 19 2004
Viewed as a partition, row n is the smallest partition that contains every partition of n. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 11 2006
Row sums = A006218 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 30 2007
|
|
LINKS
|
T. D. Noe, Rows n=1..50 of triangle, flattened
|
|
FORMULA
|
G.f.: 1/(1-x)*Sum_(k>=1} x^k/(1-y*x^k). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 05 2004
Triangle A010766 = A000012 * A051731 as infinite lower triangular matrices. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 30 2007
Equals A000012 * A051731 as infinite lower triangular matrices. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 14 2007
|
|
EXAMPLE
|
1; 2,1; 3,1,1; 4,2,1,1; 5,2,1,1,1; ...
|
|
CROSSREFS
|
Another version of A003988.
Cf. A013942. Also ... A033330, ...
Cf. A006218, A115725.
T(n,1)=n, T(n,2)=A008619(n-2) for n>1, T(n,3)=A008620(n-3) for n>2, T(n,4)=A008621(n-4) for n>3, T(n,5)=A002266(n) for n>4, T(n,n)=1.
Cf. A051731, A006218.
Cf. A051731, A000012.
Adjacent sequences: A010763 A010764 A010765 this_sequence A010767 A010768 A010769
Sequence in context: A084296 A062534 A088425 this_sequence A135841 A089178 A116599
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.003 seconds
|
