login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A308046
a(n) = 2*nextprime(n - 1) - 2*n, where nextprime(n) is the smallest prime > n.
0
2, 0, 0, 2, 0, 2, 0, 6, 4, 2, 0, 2, 0, 6, 4, 2, 0, 2, 0, 6, 4, 2, 0, 10, 8, 6, 4, 2, 0, 2, 0, 10, 8, 6, 4, 2, 0, 6, 4, 2, 0, 2, 0, 6, 4, 2, 0, 10, 8, 6, 4, 2, 0, 10, 8, 6, 4, 2, 0, 2, 0, 10, 8, 6, 4, 2, 0, 6, 4, 2, 0, 2, 0, 10, 8, 6, 4, 2, 0, 6, 4, 2, 0, 10
OFFSET
1,1
COMMENTS
For n > 1, a(n) is the difference of the larger and smaller part of the single partition of 2n into two parts whose larger part is the smallest prime > n - 1.
FORMULA
a(n) = 2*A151800(n - 1) - 2*n.
EXAMPLE
a(9) = 4; the smallest prime > 8 is 11, 2*9-11 = 7 and 11-7 = 4.
MATHEMATICA
Table[2 NextPrime[n - 1, 1] - 2 n, {n, 100}]
CROSSREFS
Cf. A151800.
Sequence in context: A339441 A226914 A110036 * A289323 A086937 A213024
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 10 2019
STATUS
approved