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!)
A105308 Indices n of primes p(n), p(n+2) such that p(n)-1 and p(n+2)-1 have the same largest prime factor. 1

%I #11 May 14 2016 16:04:08

%S 4,6,11,45,1408,13313,41752,142122836,48792948403

%N Indices n of primes p(n), p(n+2) such that p(n)-1 and p(n+2)-1 have the same largest prime factor.

%C These numbers are rare. Are they finite? Proof?

%C a(10) > 1.2*10^12, if it exists. - _Giovanni Resta_, May 14 2016

%e The prime factors of prime(45) - 1 = 2, 2, 7, 7;

%e the prime factors of prime(47) - 1 = 2, 3, 5, 7;

%e and 7 is the common largest factor.

%t t = {0, 0, 0}; Do[ t = {t[[2]], t[[3]], FactorInteger[ Prime[n + 2] - 1][[ -1, 1]]}; If[ t[[1]] == t[[3]], Print[n]], {n, 195000000}] (* _Robert G. Wilson v_, Jun 04 2005 *)

%o (PARI) /* prime indices such that gd of prime(x)+ k and prime(x+m) + k are equal */ divpm1(n,m,k) = { local(x,l1,l2,v1,v2); for(x=2,n, v1 = ifactor(prime(x)+ k); v2 = ifactor(prime(x+m)+k); l1 = length(v1); l2 = length(v2); if(v1[l1] == v2[l2], print1(x",") ) ) }

%o ifactor(n) = /* Vector of the prime factors of n*/ { local(f,j,k,flist); flist=[]; f=Vec(factor(n)); for(j=1,length(f[1]), for(k = 1,f[2][j],flist = concat(flist,f[1][j]) ); ); return(flist) }

%Y Cf. A105404.

%K more,nonn

%O 2,1

%A _Cino Hilliard_, May 01 2005

%E a(8) from _Robert G. Wilson v_, Jun 04 2005

%E a(9) from _Giovanni Resta_, May 14 2016

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 April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)