The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122465 Smooth Power Quartets: The m-th number in the sequence, n, is part of the minimum quartet of numbers n through n-3 such that the highest prime factor of each number x <= floor(x^(1/m)). 2
 5, 1683, 3678726, 22377473783 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS These were found by R. Gerbicz. LINKS Fred Schneider and R. Gerbicz, Smooth Power Trios. EXAMPLE 1680 = 2^4*3*5*7, 1681 = 41^2, 1682 = 2*29^2, 1683 = 3^2*11*17; 7 < floor(sqrt(1680)) = 40 and 41 <= floor(sqrt(1681)) = 41, so 1683 is a term. CROSSREFS Cf. A122463, A122464. Sequence in context: A237914 A057199 A198246 * A203683 A330057 A324265 Adjacent sequences:  A122462 A122463 A122464 * A122466 A122467 A122468 KEYWORD hard,more,nonn,uned AUTHOR Fred Schneider, Sep 09 2006 STATUS approved

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

Last modified October 7 16:02 EDT 2022. Contains 357275 sequences. (Running on oeis4.)