login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089212 Primes p such that p-1 and p+1 are divisible by a fifth power. 6

%I

%S 13121,20897,25759,75329,80191,106433,118751,137537,153089,157951,

%T 176417,191969,196831,207521,212383,215297,230849,243487,251263,

%U 274591,281249,285281,313471,318751,321247,324161,331937,336799,347489,378593

%N Primes p such that p-1 and p+1 are divisible by a fifth power.

%H Amiram Eldar, <a href="/A089212/b089212.txt">Table of n, a(n) for n = 1..10000</a>

%e 13121 is a term since 13121 - 1 = 2^6 * 5 * 41, 13121 + 1 = 2 * 3^8.

%t f[n_]:=Max[Last/@FactorInteger[n]]; lst={};Do[p=Prime[n];If[f[p-1]>=5&&f[p+1]>=5,AppendTo[lst,p]],{n,8!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Oct 03 2009 *)

%o (PARI) \Input no. of iterations n, power p and number to subtract and add k. powerfreep4(n,p,k) = { c=0; pc=0; forprime(x=2,n, pc++; if(!ispowerfree(x-k,p) && !ispowerfree(x+k,p), c++; print1(x","); ) ); print(); print(c","pc","c/pc+.0) } ispowerfree(m,p1) = { flag=1; y=component(factor(m),2); for(i=1,length(y), if(y[i] >= p1,flag=0;break); ); return(flag) }

%Y Cf. A075432, A086708, A086709.

%K easy,nonn

%O 1,1

%A _Cino Hilliard_, Dec 09 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 23:30 EDT 2020. Contains 335600 sequences. (Running on oeis4.)