|
|
A076302
|
|
Triangle T(n,k) = number of k-smooth divisors of n, read by rows.
|
|
0
|
|
|
1, 1, 2, 1, 1, 2, 1, 3, 3, 3, 1, 1, 1, 1, 2, 1, 2, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 2, 1, 4, 4, 4, 4, 4, 4, 4, 1, 1, 3, 3, 3, 3, 3, 3, 3, 1, 2, 2, 2, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1
1 2
1 1 2
1 3 3 3
1 1 1 1 2
1 2 4 4 4 4
1 1 1 1 1 1 2
1 4 4 4 4 4 4 4
1 1 3 3 3 3 3 3 3
|
|
MATHEMATICA
|
T[n_, k_] := Times@@(IntegerExponent[n, #]+1& /@ Select[Range[2, k], PrimeQ]);
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|