|
Search: id:A020733
|
|
|
| A020733 |
|
Consider number of prime divisors of C(n,k), k=0..n; a(n) = multiplicity of maximal value. |
|
+0
2
|
|
| 2, 1, 2, 1, 2, 5, 4, 1, 4, 2, 4, 1, 2, 5, 8, 1, 2, 5, 8, 2, 6, 7, 8, 5, 8, 11, 2, 2, 4, 11, 10, 3, 8, 2, 6, 3, 6, 2, 4, 1, 2, 5, 8, 2, 12, 16, 16, 5, 6, 13, 8, 12, 12, 4, 8, 5, 4, 5, 6, 4, 2, 6, 10, 1, 2, 7, 6, 5, 2, 2, 12, 15, 16, 2, 8, 11, 2, 10, 10, 11, 2, 6, 12, 3, 16, 2, 4, 8, 10, 5, 2, 2, 4, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
The number of distinct primes of C(15,k) are {0,2,3,3,4,4,4,4,4,4,4,4,3,3,2,0}; maximum is 4 and occurs 8 times; thus a[ 15 ]=8.
|
|
CROSSREFS
|
Cf. A001221, A048484, A048486.
Sequence in context: A099986 A050325 A001314 this_sequence A059913 A083273 A106157
Adjacent sequences: A020730 A020731 A020732 this_sequence A020734 A020735 A020736
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu)
|
|
|
Search completed in 0.002 seconds
|
