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!)
A096015 a(n) = A096014(n) / 2. 2
1, 3, 3, 3, 5, 5, 7, 3, 3, 3, 11, 5, 13, 3, 3, 3, 17, 5, 19, 3, 3, 3, 23, 5, 5, 3, 3, 3, 29, 7, 31, 3, 3, 3, 5, 5, 37, 3, 3, 3, 41, 5, 43, 3, 3, 3, 47, 5, 7, 3, 3, 3, 53, 5, 5, 3, 3, 3, 59, 7, 61, 3, 3, 3, 5, 5, 67, 3, 3, 3, 71, 5, 73, 3, 3, 3, 7, 5, 79, 3, 3, 3, 83, 5, 5, 3, 3, 3, 89, 7, 7, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For n > 1, a(n) is the larger of the least prime dividing n and the least prime not dividing n. - Peter Munn, Feb 21 2024
LINKS
FORMULA
a(n) = if n is odd then A020639(n) else A053669(n).
CROSSREFS
Sequence in context: A130823 A101435 A077886 * A046702 A357057 A226592
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Jun 15 2004
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 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)