This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A269364 Difference between the number of occurrences of prime gaps not divisible by 3, versus number of prime gaps that are multiples of 3, up to n-th prime gap: a(n) = A269849(n) - A269850(n). 9
 1, 2, 3, 4, 5, 6, 7, 8, 7, 8, 7, 8, 9, 10, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 11, 12, 13, 14, 15, 16, 17, 16, 17, 18, 19, 18, 17, 18, 17, 16, 17, 18, 19, 20, 21, 20, 19, 20, 21, 22, 21, 22, 23, 22, 21, 20, 21, 20, 21, 22, 23, 24, 25, 26, 27, 28, 27, 28, 29, 30, 29, 30, 29, 28, 29, 28, 29, 30, 31, 32, 33, 34, 35, 34 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This is related to "Lemke Oliver-Soundararajan bias", term first used by Terence Tao March 14, 2016 in his blog. LINKS Antti Karttunen, Table of n, a(n) for n = 1..50000 Robert J. Lemke Oliver and Kannan Soundararajan, Unexpected biases in the distribution of consecutive primes, arXiv:1603.03720 [math.NT], 2016. Terence Tao, Biases between consecutive primes, blog entry March 14, 2016 FORMULA a(n) = A269849(n) - A269850(n). PROG (Scheme) (define (A269364 n) (- (A269849 n) (A269850 n))) (PARI) a(n) = sum(k=1, n, ((prime(k+1) - prime(k)) % 3) != 0) - sum(k=1, n, ((prime(k+1) - prime(k)) % 3) == 0); \\ Michel Marcus, Mar 18 2016 CROSSREFS Cf. A001223, A137264, A269849, A269850, A270189, A270190. Cf. also A270310, A038698. Sequence in context: A073795 A017893 A017883 * A245353 A063278 A110011 Adjacent sequences:  A269361 A269362 A269363 * A269365 A269366 A269367 KEYWORD nonn AUTHOR Antti Karttunen, Mar 17 2016 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 January 22 14:24 EST 2019. Contains 319364 sequences. (Running on oeis4.)