login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079747 Numbers k such that gpf(k-1) < gpf(k) < gpf(k+1), where gpf(k) is the greatest prime factor of k (A006530). 4
2, 9, 10, 21, 22, 25, 28, 33, 46, 57, 58, 78, 82, 85, 91, 92, 93, 106, 115, 121, 126, 133, 136, 141, 145, 148, 166, 169, 170, 171, 172, 176, 177, 178, 190, 201, 205, 213, 217, 221, 222, 226, 232, 235, 236, 248, 253, 261, 262, 276, 289, 290, 301, 316, 325, 346 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers k such that A079748(k-1) > 1.
LINKS
FORMULA
a(n) = A071869(n-1) + 1. - T. D. Noe, Nov 26 2007
EXAMPLE
k=25: 25-1 = 24 = 3*2^3, 25 = 5^2 and 25+1 = 26 = 13*2, therefore 25 is a term (3 < 5 < 13).
MATHEMATICA
gpf[n_] := FactorInteger[n][[-1, 1]]; ind = Position[Differences[Array[gpf, 350]], _?(# > 0 &)] // Flatten; ind[[Position[Differences[ind], 1] // Flatten]] + 1 (* Amiram Eldar, Jun 05 2022 *)
CROSSREFS
Sequence in context: A046975 A304441 A005695 * A191576 A081346 A301872
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 10 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)