|
|
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
|
|
|
FORMULA
|
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]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|