The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308052 a(n) = nextprime(ceiling(n/2)-1), where nextprime(n) is the smallest prime > n. 0
 2, 2, 2, 2, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 17, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For n >= 3, a(n) is the smallest prime appearing among the larger parts of the partitions of n into two parts. LINKS FORMULA a(n) = A151800(ceiling(n/2)-1). a(n) = A151800(floor((n-1)/2)). - Wesley Ivan Hurt, Jun 05 2021 EXAMPLE a(7) = 5; 7 has three partitions into two parts: (6,1), (5,2) and (4,3). The smallest prime among the larger parts is 5, so a(7) = 5. MATHEMATICA Table[NextPrime[Ceiling[n/2] - 1, 1], {n, 100}] CROSSREFS Cf. A151800. Sequence in context: A081651 A269333 A029193 * A005858 A285798 A321346 Adjacent sequences:  A308049 A308050 A308051 * A308053 A308054 A308055 KEYWORD nonn,easy AUTHOR Wesley Ivan Hurt, May 10 2019 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.

Last modified July 3 04:57 EDT 2022. Contains 355030 sequences. (Running on oeis4.)