This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308050 a(n) = n - prevprime(n - 1), where prevprime(n) is the largest prime < n. 0
 2, 2, 3, 2, 3, 2, 3, 4, 5, 2, 3, 2, 3, 4, 5, 2, 3, 2, 3, 4, 5, 2, 3, 4, 5, 6, 7, 2, 3, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 2, 3, 2, 3, 4, 5, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 7, 2, 3, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 2, 3, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 2, 3, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 COMMENTS a(n) is the smallest part appearing in the single partition of n into two parts whose largest prime part is < n - 1. LINKS FORMULA a(n) = n - A151799(n - 1). EXAMPLE a(11) = 4; 11 has 5 partitions into 2 parts: (10,1), (9,2), (8,3), (7,4) and (6,5). The single partition containing the largest prime part < 10 is (7,4) and 4 is the smallest part in this partition, so a(11) = 4. MATHEMATICA Table[n - NextPrime[n - 1, -1], {n, 4, 100}] CROSSREFS Cf. A151799. Sequence in context: A295568 A099427 A059964 * A248147 A087458 A052180 Adjacent sequences:  A308047 A308048 A308049 * A308051 A308052 A308053 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 15 21:17 EDT 2019. Contains 328038 sequences. (Running on oeis4.)