|
Search: id:A132896
|
|
|
| A132896 |
|
Triangle read by rows: T(n,k)=number of prime divisors of C(n,k), counted with multiplicity (0<=k<=n). |
|
+0
2
|
|
| 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 2, 2, 0, 0, 1, 2, 2, 1, 0, 0, 2, 2, 3, 2, 2, 0, 0, 1, 2, 2, 2, 2, 1, 0, 0, 3, 3, 4, 3, 4, 3, 3, 0, 0, 2, 4, 4, 4, 4, 4, 4, 2, 0, 0, 2, 3, 5, 4, 5, 4, 5, 3, 2, 0, 0, 1, 2, 3, 4, 4, 4, 4, 3, 2, 1, 0, 0, 3, 3, 4, 4, 6, 5, 6, 4, 4, 3, 3, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,12
|
|
|
LINKS
|
T. D. Noe, Rows n=0..100 of triangle, flattened
|
|
EXAMPLE
|
T(8,3)=4 because C(8,3)=56=2*2*2*7.
Triangle begins:
0;
0,0;
0,1,0;
0,1,1,0;
0,2,2,2,0;
0,1,2,2,1,0;
|
|
MAPLE
|
with(numtheory): T:=proc(n, k) if k <= n then bigomega(binomial(n, k)) else x end if end proc: for n from 0 to 12 do seq(T(n, k), k=0..n) end do; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A048571, which counts only distinct factors.
Sequence in context: A039967 A123186 A127323 this_sequence A089789 A004541 A037864
Adjacent sequences: A132893 A132894 A132895 this_sequence A132897 A132898 A132899
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 16 2007
|
|
|
Search completed in 0.002 seconds
|
