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!)
A082048 a(n) = least number greater than n having greater smallest prime factor than that of n. 3
2, 3, 5, 5, 7, 7, 11, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 23, 21, 23, 23, 29, 25, 29, 27, 29, 29, 31, 31, 37, 33, 35, 35, 37, 37, 41, 39, 41, 41, 43, 43, 47, 45, 47, 47, 53, 49, 53, 51, 53, 53, 59, 55, 59, 57, 59, 59, 61, 61, 67, 63, 65, 65, 67, 67, 71, 69, 71, 71, 73, 73 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
A020639(a(n)) > A020639(n) and A020639(i) <= A020639(n) for n < i < a(n);
for m > 1: a(m) = m+1 iff m even;
p prime: a(p) = next prime: a(A000040(n)) = A000040(A049084(n)+1).
MATHEMATICA
gsp[n_]:=Module[{k=n+1, f=FactorInteger[n][[1, 1]]}, While[ FactorInteger[ k] [[1, 1]]<=f, k++]; k]; Array[gsp, 80] (* Harvey P. Dale, Sep 05 2015 *)
CROSSREFS
Sequence in context: A298676 A114519 A126762 * A113459 A305430 A159477
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 02 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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)