Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089200
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A089200
%S A089200 17,41,73,89,97,109,113,137,163,193,233,241,251,257,271,281,313,337,353,
%T A089200 379,401,409,433,449,457,487,521,541,569,577,593,601,617,641,673,751,
%U A089200 757,761,769,809,811,857,881,919,929,937,953,977
%N A089200 Primes p such that p-1 is divisible by a cube.
%t A089200 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]
%o A089200 (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) }
%Y A089200 Sequence in context: A052279 A147215 A126790 this_sequence A004625 A141174 
               A007519
%Y A089200 Adjacent sequences: A089197 A089198 A089199 this_sequence A089201 A089202 
               A089203
%K A089200 easy,nonn
%O A089200 1,1
%A A089200 Cino Hilliard (hillcino368(AT)gmail.com), Dec 08 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research