proposed
approved
proposed
approved
editing
proposed
Number of non-unitary prime divisors of Catalan- numbers, i.e. , number of those prime- factors whose exponent is greater than one.
n=25: Catalan[25]=C[50,25]/26=4861946401452 =(2.2.3.3.7.7).29.31.37.41.43.47 unitary p-divisors = {29,31,37,41,43,47}, non-unitary ones = {2,3,7}, so a(25)=3.
For n=25: Catalan(25) = binomial(50,25)/26 = 4861946401452 =(2*2*3*3*7*7)*29*31*37*41*43*47;
unitary prime divisors: {29,31,37,41,43,47};
non-unitary prime divisors: {2,3,7}, so a(25) = 3.
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
(PARI) catalan(n) = binomial(2*n, n)/(n+1);
nbud(n) = #select(x->x!=1, factor(n)[, 2]);
a(n) = nbud(catalan(n)); \\ Michel Marcus, Feb 26 2017
n=25: Catalan[25]=C[50,25]/26=4861946401452 =(2.2.3.3.7.7).29.31.37.41.43.47 unitary p-divisors = {29,31,37,41,43,47}, non-unitary ones = {2,3,7}, so a(25)=3/.
proposed
editing
editing
proposed
Michael De Vlieger, <a href="/A081389/b081389.txt">Table of n, a(n) for n = 1..10000</a>
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 *)
approved
editing