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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190383 Numbers with prime factorization pqrst^5. 4
 36960, 43680, 57120, 63840, 68640, 77280, 89760, 96096, 97440, 100320, 104160, 106080, 118560, 121440, 124320, 125664, 137760, 140448, 143520, 144480, 148512, 153120, 155040, 157920, 160160, 163680, 165984, 170016, 178080, 180960, 187110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 Will Nicholes, Prime Signatures MATHEMATICA f[n_]:=Sort[Last/@FactorInteger[n]]=={1, 1, 1, 1, 5}; Select[Range[500000], f] PROG (PARI) list(lim)=my(v=List(), t1, t2, t3, t4); forprime(p1=2, sqrtnint(lim\210, 5), t1=p1^5; forprime(p2=2, lim\(30*t1), if(p2==p1, next); t2=p2*t1; forprime(p3=2, lim\(6*t2), if(p3==p1 || p3==p2, next); t3=p3*t2; forprime(p4=2, lim\(2*t3), if(p4==p1 || p4==p2 || p4==p3, next); t4=p4*t3; forprime(p5=2, lim\t4, if(p5==p1 || p5==p2 || p5==p3 || p5==p4, next); listput(v, t4*p5)))))); Set(v) \\ Charles R Greathouse IV, Aug 25 2016 CROSSREFS Cf. A190320, A190382. Sequence in context: A204104 A229509 A223304 * A051393 A233914 A144801 Adjacent sequences:  A190380 A190381 A190382 * A190384 A190385 A190386 KEYWORD nonn AUTHOR Vladimir Joseph Stephan Orlovsky, May 09 2011 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 December 5 12:04 EST 2021. Contains 349557 sequences. (Running on oeis4.)