OFFSET
1,1
MATHEMATICA
Do[p = Prime[n] - 1; q = Prime[n+3] - 1; l = Select[Divisors[p], PrimeQ]; m = Select[Divisors[q], PrimeQ]; If[Max[l] == Max[m], Print[n]], {n, 1, 10^7}] (* Ryan Propper, Sep 19 2005 *)
PROG
(PARI) \\prime indices such that gd of prime(x)+ k and prime(x+m) + k are equal
divpm1(n, m=3, k=-1) = { 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", ") ) ) }
\\Vector of the prime factors of n
ifactor(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) }
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, May 01 2005
EXTENSIONS
More terms from Ryan Propper, Sep 19 2005
a(16)-a(27) from Donovan Johnson, Apr 03 2008
Name edited and offset changed by Jon E. Schoenfield, Nov 19 2018
a(28)-a(29) from Giovanni Resta, Nov 20 2018
STATUS
approved