|
Search: id:A089200
|
|
|
| A089200 |
|
Primes p such that p-1 is divisible by a cube. |
|
+0
5
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
f[n_]:=Max[Last/@FactorInteger[n]]; lst={}; Do[p=Prime[n]; If[f[p-1]>=3, AppendTo[lst, p]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 03 2009]
|
|
PROGRAM
|
(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 this_sequence A004625 A141174 A007519
Adjacent sequences: A089197 A089198 A089199 this_sequence A089201 A089202 A089203
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 08 2003
|
|
|
Search completed in 0.002 seconds
|
