This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117368 a(n) = largest prime less than the smallest prime dividing (2n-1). 2
 2, 3, 5, 2, 7, 11, 2, 13, 17, 2, 19, 3, 2, 23, 29, 2, 3, 31, 2, 37, 41, 2, 43, 5, 2, 47, 3, 2, 53, 59, 2, 3, 61, 2, 67, 71, 2, 5, 73, 2, 79, 3, 2, 83, 5, 2, 3, 89, 2, 97, 101, 2, 103, 107, 2, 109, 3, 2, 5, 7, 2, 3, 113, 2, 127, 5, 2, 131, 137, 2, 7, 3, 2, 139, 149, 2, 3, 151, 2, 5, 157, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Placing a 1 between each term of this sequence gets sequence A117365. LINKS Robert Israel, Table of n, a(n) for n = 2..10000 FORMULA From Robert Israel, Apr 14 2019: (Start) a(n) = A151799(A090368(n)). a(n) = 2*n-3 if 2*n-1 is in A006512. (End) EXAMPLE a(13) = 3 because smallest prime dividing 25 is 5 and largest prime less than 5 is 3. MAPLE with(numtheory): a:=proc(n): prevprime(factorset(2*n-1)[1]): end: seq(a(n), n=2..90); # Emeric Deutsch, Apr 22 2006 MATHEMATICA prs=Prime[Range[50]]; f[n_]:=NextPrime[First[Select[prs, Divisible[2 n-1, #]&]], -1] f/@Range[2, 90]  (* Harvey P. Dale, Jan 23 2011 *) CROSSREFS Cf. A006512, A090368, A117365, A151799. Sequence in context: A174562 A224382 A069227 * A137826 A021429 A262217 Adjacent sequences:  A117365 A117366 A117367 * A117369 A117370 A117371 KEYWORD nonn AUTHOR Leroy Quet, Mar 10 2006 EXTENSIONS More terms from Emeric Deutsch, Apr 22 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 16 20:35 EDT 2019. Contains 328103 sequences. (Running on oeis4.)