Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Nov 21 2013 12:48:38
%S 5,13,17,19,37,41,43,61,67,73,97,101,109,113,137,151,157,163,181,193,
%T 197,211,229,241,251,257,271,277,281,283,313,331,337,353,379,397,401,
%U 409,421,433,443,457,463,487,491,521,523,541,547,577,601,613,617,631
%N Primes p such that the largest prime divisor of p-1 is less than the largest prime divisor of p+1.
%H Karl Hovekamp, <a href="/A103666/b103666.txt">Table of n, a(n) for n=1..39168</a>
%e a(1)=5 because the largest prime divisor of 4 is less than the largest prime divisor of 6.
%t Select[Prime[Range[2,200]],Max[Transpose[FactorInteger[#-1]][[1]]]< Max[Transpose[FactorInteger[#+1]][[1]]]&] (* _Harvey P. Dale_, Apr 26 2011 *)
%Y Cf. A023503 greatest prime divisor of n-th prime - 1, A023509 greatest prime divisor of n-th prime + 1, A103667.
%K nonn
%O 1,1
%A _Hugo Pfoertner_, Feb 19 2005