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!)
A117367 a(n) = smallest prime greater than the smallest prime dividing n. 5
2, 3, 5, 3, 7, 3, 11, 3, 5, 3, 13, 3, 17, 3, 5, 3, 19, 3, 23, 3, 5, 3, 29, 3, 7, 3, 5, 3, 31, 3, 37, 3, 5, 3, 7, 3, 41, 3, 5, 3, 43, 3, 47, 3, 5, 3, 53, 3, 11, 3, 5, 3, 59, 3, 7, 3, 5, 3, 61, 3, 67, 3, 5, 3, 7, 3, 71, 3, 5, 3, 73, 3, 79, 3, 5, 3, 11, 3, 83, 3, 5, 3, 89, 3, 7, 3, 5, 3, 97, 3, 11, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All even-indexed terms are 3.
LINKS
EXAMPLE
5 is the smallest prime dividing 35. So a(35) is the smallest prime > 5, which is 7.
MAPLE
with(numtheory): a:=proc(n): if n=1 then 2 else nextprime(factorset(n)[1]) fi: end: seq(a(n), n=1..100); # Emeric Deutsch, Apr 22 2006
MATHEMATICA
Table[NextPrime[FactorInteger[n][[1, 1]]], {n, 93}] (* Michael De Vlieger, Sep 16 2017 *)
CROSSREFS
Sequence in context: A147593 A108396 A239476 * A080184 A052248 A092386
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)