login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081389 Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one. 6
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,13
LINKS
FORMULA
a(n) = A056170(A000108(n)).
EXAMPLE
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.
MATHEMATICA
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 *)
PROG
(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
CROSSREFS
Sequence in context: A123736 A358476 A185304 * A133685 A281492 A112183
KEYWORD
nonn
AUTHOR
Labos Elemer, Mar 27 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)