cp's OEIS Frontend

A020733 Consider number of prime divisors of binomial(n,k), k=0..n; a(n) = multiplicity of the maximum value.

%I A020733 #28 Sep 21 2024 08:42:11
%S A020733 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,
%T A020733 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,
%U A020733 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
%N A020733 Consider number of prime divisors of binomial(n,k), k=0..n; a(n) = multiplicity of the maximum value.
%H A020733 Amiram Eldar, <a href="/A020733/b020733.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2000 from Robert Israel)
%e A020733 The number of distinct primes of binomial(15,k) are {0,2,3,3,4,4,4,4,4,4,4,4,3,3,2,0}. The maximum is 4 and it occurs 8 times, thus a(15) = 8.
%p A020733 f:= proc(n) local A,i;
%p A020733   A:= [seq(nops(numtheory:-factorset(binomial(n,i))),i=0..n)];
%p A020733   numboccur(max(A),A);
%p A020733 end proc:
%p A020733 map(f, [$1..100]); # _Robert Israel_, May 26 2020
%t A020733 a[n_] := Sort[Tally[Table[PrimeNu[Binomial[n, k]], {k, 0, n}]]][[-1, 2]];
%t A020733 Array[a, 100] (* _Jean-François Alcover_, Jun 09 2020 *)
%o A020733 (PARI) a(n) = {v = vector(n+1, k, omega(binomial(n, k-1))); m = vecmax(v); sum(i=1, n+1, v[i] == m);} \\ _Michel Marcus_, Dec 30 2013
%Y A020733 Cf. A001221, A048484, A048486.
%K A020733 nonn
%O A020733 1,1
%A A020733 _Labos Elemer_