|
Search: id:A020738
|
|
|
| A020738 |
|
Consider number of divisors of C(n,k), k=0..n; a(n) = multiplicity of maximal value. |
|
+0
3
|
|
| 2, 1, 2, 1, 2, 1, 4, 3, 4, 1, 4, 3, 2, 1, 2, 1, 6, 2, 6, 2, 6, 1, 8, 2, 2, 1, 4, 2, 2, 1, 10, 4, 2, 5, 2, 2, 2, 1, 2, 1, 6, 2, 2, 2, 4, 1, 2, 1, 2, 2, 6, 2, 4, 2, 2, 4, 2, 1, 10, 2, 2, 3, 4, 8, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, 6, 2, 2, 2, 12, 2, 2, 1, 2, 4, 4, 2, 2, 2, 2, 1, 2, 2, 2, 1, 4, 2, 4, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
If n=23, the divisors for {C[ 23,k ]} are {1,2,4,8,16,16,32,32,64,64,64,64,64,64,64,64,32,...}. The maximum occurs 8 times, so a[ 23 ]=8.
|
|
CROSSREFS
|
Cf. A000005, A048485, A048569.
Sequence in context: A050334 A029218 A100376 this_sequence A063279 A124333 A002107
Adjacent sequences: A020735 A020736 A020737 this_sequence A020739 A020740 A020741
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu)
|
|
|
Search completed in 0.002 seconds
|
