This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089200 Primes p such that p-1 is divisible by a cube. 4
 17, 41, 73, 89, 97, 109, 113, 137, 163, 193, 233, 241, 251, 257, 271, 281, 313, 337, 353, 379, 401, 409, 433, 449, 457, 487, 521, 541, 569, 577, 593, 601, 617, 641, 673, 751, 757, 761, 769, 809, 811, 857, 881, 919, 929, 937, 953, 977 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA f[n_]:=Max[Last/@FactorInteger[n]]; lst={}; Do[p=Prime[n]; If[f[p-1]>=3, AppendTo[lst, p]], {n, 6!}]; lst (* Vladimir Joseph Stephan Orlovsky, Oct 03 2009 *) Select[Prime[Range[200]], Count[Transpose[FactorInteger[#-1]][[2]], _?(#>2&)]>0&] (* Harvey P. Dale, Jan 01 2012 *) PROG (PARI) powerfreep3(n, p, k) = { c=0; pc=0; forprime(x=2, n, pc++; if(ispowerfree(x+k, p)==0, 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) } CROSSREFS Sequence in context: A052279 A147215 A126790 * A263011 A263012 A172280 Adjacent sequences:  A089197 A089198 A089199 * A089201 A089202 A089203 KEYWORD easy,nonn AUTHOR Cino Hilliard, Dec 08 2003 STATUS approved

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.

Last modified October 15 00:14 EDT 2019. Contains 328025 sequences. (Running on oeis4.)