A081388 -id:A081388 - cp's OEIS frontend

A081387 Number of non-unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of prime factors in C(2n,n) whose exponent is greater than one.

0, 0, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 2, 2, 2, 2, 1, 1, 3, 3, 3, 3, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 3, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 2, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 3, 3, 3, 2, 4, 2, 2, 3, 3, 3, 3, 4, 4, 5, 4, 4, 2, 3, 3, 2, 2, 2, 4, 3, 3, 4, 3, 4, 5, 4, 2, 2, 2, 3, 5, 5, 5, 5, 3, 2, 3, 2, 3, 3, 3

Offset: 1

Labos Elemer, Mar 27 2003

nonn

			For n = 14: binomial(28,14) = 40116600 = 2*2*2*3*3*3*5*5*17*19*23; unitary prime divisors: {17,19,23}; non-unitary prime divisors: {2,3,5}, so a(14) = 3.

T. D. Noe, Table of n, a(n) for n = 1..10000

Cf. A000984, A034444, A048105, A056169, A056170, A067434, A081387, A081388, A081389.

Table[Count[Transpose[FactorInteger[Binomial[2n,n]]][[2]],?(#>1&)],{n,110}] (* _Harvey P. Dale, Oct 08 2012 *)

a(n) = {my(e = factor(binomial(2*n, n))[, 2]); sum(k = 1, #e, e[k] > 1);} \\ Amiram Eldar, Oct 05 2024

a(n) = A056170(A000984(n)) = A001221(A000984(n)) - A081386(n) = A067434(n) - A081386(n).

A081389 Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one.

Original entry on oeis.org

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

Offset: 1

Labos Elemer, Mar 27 2003

nonn

			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.

Michael De Vlieger, Table of n, a(n) for n = 1..10000

Cf. A000108, A034444, A048105, A056169, A056170, A080405, A081386, A081387, A081388.

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 *)

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

a(n) = A056170(A000108(n)).

A081391 Numbers k such that the central binomial coefficient C(2*k,k) has only one prime divisor whose exponent equals one.

Original entry on oeis.org

3, 6, 7, 8, 9, 10, 11, 12, 16, 21, 22, 28, 29, 30, 31, 36, 37, 54, 55, 57, 58, 110, 171, 784, 786

Offset: 1

Labos Elemer, Mar 27 2003

Numbers k such that C(2*k,k) has one non-unitary prime divisor.
Numbers k for which A081387(k) = 1.
No more terms through 10^6; conjecture: no terms after 786. - Jon E. Schoenfield, Jul 29 2017

			For k = 786, C(1572,786) = 2*2*2*2*m, where m is a squarefree product of 169 primes.

Cf. A000108, A000984, A001405, A046098, A081386, A081387, A081388, A081389, A081390, A080664.

q[k_] := Count[FactorInteger[Binomial[2*k, k]][[;;, 2]], ?( # > 1 &)] == 1; Select[Range[1000], q] (* _Amiram Eldar, Oct 05 2024 *)

is(k) = {my(e = factor(binomial(2*k, k))[, 2]); sum(i = 1, #e, e[i] > 1) == 1;} \\ Amiram Eldar, Oct 05 2024

A081390 Number k such that the k-th Catalan number has only one non-unitary prime divisor; all the other prime divisors have exponent one.

Original entry on oeis.org

6, 10, 12, 15, 16, 20, 21, 22, 27, 28, 29, 30, 32, 33, 34, 36, 37, 39, 53, 54, 55, 56, 57, 58, 65, 67, 79, 80, 109, 110, 129, 135, 159, 161, 170, 171, 255, 783, 784, 785, 786, 902

Offset: 1

Labos Elemer, Mar 27 2003

a(43) > 25000, if it exists. - Amiram Eldar, Jul 22 2024

			902 is a term because binomial(1804,902)/903 has 189 prime factor, 188 stand with exponent one, but 2 with 5: 2^5.

Cf. A000108, A081386, A081387, A081388, A081389, A080405, A080664.

c[n_] := Count[FactorInteger[n][[;; , 2]], ?(# > 1 &)]; Select[Range[0, 1000], c[CatalanNumber[#]] == 1 &] (* _Amiram Eldar, Jul 22 2024 *)

cp's OEIS Frontend

A081387 Number of non-unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of prime factors in C(2n,n) whose exponent is greater than one.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A081389 Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A081391 Numbers k such that the central binomial coefficient C(2*k,k) has only one prime divisor whose exponent equals one.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

A081390 Number k such that the k-th Catalan number has only one non-unitary prime divisor; all the other prime divisors have exponent one.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica