|
%I #13 Jul 29 2017 19:24:58
%S 0,0,0,0,0,1,0,0,0,1,0,1,2,2,1,1,0,2,0,1,1,1,2,2,3,2,1,1,1,1,0,1,1,1,
%T 0,1,1,2,1,2,2,2,3,2,2,3,2,3,2,2,2,2,1,1,1,1,1,1,2,2,3,2,2,2,1,2,1,3,
%U 3,3,2,4,4,4,4,2,2,3,1,1,2,2,3,2,3,3,2,4,4,2,2,2,2,3,4,5,4,3,2,2,2,2,2,2,3
%N Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one.
%H Michael De Vlieger, <a href="/A081389/b081389.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A056170(A000108(n)).
%e For n=25: Catalan(25) = binomial(50,25)/26 = 4861946401452 =(2*2*3*3*7*7)*29*31*37*41*43*47;
%e unitary prime divisors: {29,31,37,41,43,47};
%e non-unitary prime divisors: {2,3,7}, so a(25) = 3.
%t Table[Boole[n == 1] + PrimeNu@ # - Count[Transpose[FactorInteger@ #][[2]], 1] &@ CatalanNumber@ n, {n, 105}] (* _Michael De Vlieger_, Feb 25 2017, after _Harvey P. Dale_ at A056169 *)
%o (PARI) catalan(n) = binomial(2*n, n)/(n+1);
%o nbud(n) = #select(x->x!=1, factor(n)[,2]);
%o a(n) = nbud(catalan(n)); \\ _Michel Marcus_, Feb 26 2017
%Y Cf. A000108, A034444, A048105, A056169, A056170, A080405, A081386, A081387, A081388.
%K nonn
%O 1,13
%A _Labos Elemer_, Mar 27 2003
|
