This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117366 a(n) = smallest prime greater than the largest prime dividing n. 8
 2, 3, 5, 3, 7, 5, 11, 3, 5, 7, 13, 5, 17, 11, 7, 3, 19, 5, 23, 7, 11, 13, 29, 5, 7, 17, 5, 11, 31, 7, 37, 3, 13, 19, 11, 5, 41, 23, 17, 7, 43, 11, 47, 13, 7, 29, 53, 5, 11, 7, 19, 17, 59, 5, 13, 11, 23, 31, 61, 7, 67, 37, 11, 3, 17, 13, 71, 19, 29, 11, 73, 5, 79, 41, 7, 23, 13, 17, 83, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A151800(A006530(n)). - Reinhard Zumkeller, Apr 06 2015 EXAMPLE 5 is the largest prime dividing 10. So a(10) is the smallest prime > 5, which is 7. MATHEMATICA Table[Prime[PrimePi[FactorInteger[n][[Length[FactorInteger[n]]]][[1]]]+1], {n, 2, 80}], 2, 1] (* Stefan Steinerberger, Apr 09 2006 *) PROG (Haskell) a117366 = a151800 . a006530  -- Reinhard Zumkeller, Apr 06 2015 CROSSREFS Cf. A117364, A117365, A117367. Cf. A006530, A151800. Sequence in context: A052248 A092386 A117369 * A073482 A318411 A225680 Adjacent sequences:  A117363 A117364 A117365 * A117367 A117368 A117369 KEYWORD nonn AUTHOR Leroy Quet, Mar 10 2006 EXTENSIONS More terms from Stefan Steinerberger, Apr 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 17:32 EDT 2019. Contains 328373 sequences. (Running on oeis4.)