cp's OEIS Frontend

A259788 Greatest prime factor of phi(binomial(2*n,n)).

%I A259788 #21 Jul 19 2015 08:56:15
%S A259788 2,2,3,3,5,5,5,5,5,3,11,11,11,11,11,11,11,11,11,11,11,7,23,23,23,23,
%T A259788 23,23,29,29,29,29,29,29,29,29,29,29,29,29,41,41,41,41,41,41,41,41,41,
%U A259788 41,41,41,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,53,83,83,83,83,83,83,89
%N A259788 Greatest prime factor of phi(binomial(2*n,n)).
%C A259788 Conjectures:
%C A259788 (1) 7 is a unique term which is not a Sophie Germain prime (A005384);
%C A259788 (2) A Sophie Germain prime p occurs p times if and only if p=2,3,5 and 11; otherwise, it occurs q-p times, where q is the next Sophie Germain prime > p;
%C A259788 (3) a(n) is the greatest prime factor of p-1 for primes p in the interval (n, 2*n).
%C A259788 All these conjectures follow from the following strengthening of the Bertrand postulate for n>=24: the interval (n, 2*n) contains a safe prime (A005385).
%H A259788 Peter J. C. Moses, <a href="/A259788/b259788.txt">Table of n, a(n) for n = 2..5001</a>
%t A259788 Map[First[Last[FactorInteger[EulerPhi[Binomial[2#,#]]]]]&,Range[2,100]]
%Y A259788 Cf. A000010, A000984, A005384, A005385, A006530, A066973.
%K A259788 nonn
%O A259788 2,1
%A A259788 _Vladimir Shevelev_, Jul 05 2015