A080378 -id:A080378 - cp's OEIS frontend

A080379 Least n such that n consecutive values in A080378 equals 2; i.e., exactly n differences between consecutive primes give residues 2 when divided by 4.

5, 2, 9, 15, 39, 32, 305, 51, 2631, 3685, 170, 1156, 8775, 98, 5295, 41914, 106469, 167115, 186917, 1098776, 187784, 976193, 1166047, 423098, 77442332, 2643158, 11004239, 36330320, 259652255, 307899596, 2573725031, 411764049, 4080634008, 14841740642, 6022532018, 17035372732, 35045523209

Offset: 1

Labos Elemer, Mar 04 2003

nonn

a(43) = 147618899630. - Donovan Johnson

			n=4: a(4)=15,differences between {47,53,59,61,67} are {6,6,2,6} corresponds to exactly four differences congruent to 2 mod 4,since before and after 47-43=4 or 71-67=4 are congruent to 0 mod 4.

Cf. A001223, A080378, A080381.

dp[x_] := Mod[Prime[x+1]-Prime[x], 4] pat[x_, h_] := Table[dp[x+j], {j, 0, h-1}] up[x_, h_] := Union[pat[x, h]] Table[fa=1; k=0; Do[s=up[n, h]; s1=Length[s]; s2=Part[u=pat[n+1, h], Length[u]]; s3=Part[w=pat[n-1, h], 1]; If[Equal[s1, 1]&&Equal[fa, 1]&&Equal[s2, 0]&&Equal[s3, 0], k=k+1; Print[{k, h, n, Prime[n], s, s1}]; fa=0], {n, 2, 200000}], {h, 1, 19}]
With[{c=Mod[Differences[Prime[Range[12*10^5]]],4]},Join[{5,2},Drop[ Flatten[ Table[ SequencePosition[ c,Join[ {0},PadRight[ {},n,2],{0}],1][[All,1]],{n,0,25}]]+1,3]]] (* The program generates the first 24 terms of the sequence. *) (* Harvey P. Dale, Dec 01 2022 *)

a(n)=Min{x; Union[{Mod[A001223(x), 4], ..., Mod[A001223(x+n-1), 4]}]=2}

a(20)-a(37) from Donovan Johnson, Nov 16 2010

A080380 Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.

Original entry on oeis.org

4, 24, 46, 153, 1480, 90, 3875, 1395, 16591, 61457, 240748, 21355, 772038, 613491, 804584, 6067263, 16791134, 16138563, 37593808, 250379098, 73857828, 124789332, 56307979, 3295708683, 3511121443, 27497699943, 64430269615, 26284355567, 118413975572, 225822728018, 4645422093, 118027458557

Offset: 1

Labos Elemer, Mar 06 2003

nonn

			n=2: a(2)=24, p(24)=89, followed by {4, 4} consecutive prime differences, surrounded by 6=89-83 and 2=103-101 also as p-differences, both congruent to 2 modulo 4.

Cf. A001223, A080378, A080379.

dp[x_] := Mod[Prime[x+1]-Prime[x], 4] pat[x_, h_] := Table[dp[x+j], {j, 0, h-1}] up[x_, h_] := Union[pat[x, h]] Table[fa=1; k=0; Do[s=up[n, h]; s1=Length[s]; s2=Part[u=pat[n+1, h], Length[u]]; s3=Part[w=pat[n-1, h], 1]; If[Equal[s, {0}]&&Equal[fa, 1]&&Equal[s2, 2]&&Equal[s3, 2], k=k+1; Print[{k, h, n, Prime[n], s, s1}]; fa=0], {n, 2, 720000}], {h, 1, 14}]

a(15)-a(32) from Donovan Johnson, Nov 16 2010

A259396 Length of runs of identical terms in A080378.

Original entry on oeis.org

1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 6, 1, 5, 1, 1, 3, 1, 1, 8, 1, 3, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 2, 1, 6, 1, 1, 14, 1, 1, 1, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 3, 2, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 4, 1, 2, 3, 1, 2, 1, 1, 2, 11, 1, 1, 1, 2, 1, 5

Offset: 1

Zak Seidov, Jun 26 2015

nonn

Cf. A001223, A080378, A259360.

Length/@Split[Mod[Differences[Prime[Range[200]]],4]]

A001223 Prime gaps: differences between consecutive primes.

Original entry on oeis.org

1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2, 10, 14, 4, 2, 4, 14, 6, 10, 2, 4, 6, 8, 6, 6, 4, 6, 8, 4, 8, 10, 2, 10, 2, 6, 4, 6, 8, 4, 2, 4, 12, 8, 4, 8, 4, 6, 12

Offset: 1

N. J. A. Sloane

There is a unique decomposition of the primes: provided the weight A117078(n) is > 0, we have prime(n) = weight * level + gap, or A000040(n) = A117078(n) * A117563(n) + a(n). - Rémi Eismann, Feb 14 2008
Let rho(m) = A179196(m), for any n, let m be an integer such that p_(rho(m)) <= p_n and p_(n+1) <= p_(rho(m+1)), then rho(m) <= n < n + 1 <= rho(m + 1), therefore a(n) = p_(n+1) - p_n <= p_rho(m+1) - p_rho(m) = A182873(m). For all rho(m) = A179196(m), a(rho(m)) < A165959(m). - John W. Nicholson, Dec 14 2011
A solution (modular square root) of x^2 == A001248(n) (mod A000040(n+1)). - L. Edson Jeffery, Oct 01 2014
There exists a constant C such that for n -> infinity, Cramer conjecture a(n) < C log^2 prime(n) is equivalent to (log prime(n+1)/log prime(n))^n < e^C. - Thomas Ordowski, Oct 11 2014
a(n) = A008347(n+1) - A008347(n-1). - Reinhard Zumkeller, Feb 09 2015
Yitang Zhang proved lim inf_{n -> infinity} a(n) is finite. - Robert Israel, Feb 12 2015
lim sup_{n -> infinity} a(n)/log^2 prime(n) = C <==> lim sup_{n -> infinity}(log prime(n+1)/log prime(n))^n = e^C. - Thomas Ordowski, Mar 09 2015
a(A038664(n)) = 2*n and a(m) != 2*n for m < A038664(n). - Reinhard Zumkeller, Aug 23 2015
If j and k are positive integers then there are no two consecutive primes gaps of the form 2+6j and 2+6k (A016933) or 4+6j and 4+6k (A016957). - Andres Cicuttin, Jul 14 2016
Conjecture: For any positive numbers x and y, there is an index k such that x/y = a(k)/a(k+1). - Andres Cicuttin, Sep 23 2018
Conjecture: For any three positive numbers x, y and j, there is an index k such that x/y = a(k)/a(k+j). - Andres Cicuttin, Sep 29 2018
Conjecture: For any three positive numbers x, y and j, there are infinitely many indices k such that x/y = a(k)/a(k+j). - Andres Cicuttin, Sep 29 2018
Row m of A174349 lists all indices n for which a(n) = 2m. - M. F. Hasler, Oct 26 2018
Since (6a, 6b) is an admissible pattern of gaps for any integers a, b > 0 (and also if other multiples of 6 are inserted in between), the above conjecture follows from the prime k-tuple conjecture which states that any admissible pattern occurs infinitely often (see, e.g., the Caldwell link). This also means that any subsequence a(n .. n+m) with n > 2 (as to exclude the untypical primes 2 and 3) should occur infinitely many times at other starting points n'. - M. F. Hasler, Oct 26 2018
Conjecture: Defining b(n,j,k) as the number of pairs of prime gaps {a(i),a(i+j)} such that i < n, j > 0, and a(i)/a(i+j) = k with k > 0, then
  lim_{n -> oo} b(n,j,k)/b(n,j,1/k) = 1, for any j > 0 and k > 0, and
  lim_{n -> oo} b(n,j,k1)/b(n,j,k2) = C with C = C(j,k1,k2) > 0. - Andres Cicuttin, Sep 01 2019

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 92.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 186-192.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vojtech Strnad, First 100000 terms [First 10000 terms from N. J. A. Sloane]
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Anonymous ["TheHereticAnthem20"], Prime gaps mapped to sounds, Youtube video (2018).
B. Apostol, L. Panaitopol, L Petrescu, and L. Toth, Some Properties of a Sequence Defined with the Aid of Prime Numbers, J. Int. Seq. 18 (2015) # 15.5.5.
S. Ares and M. Castro, Hidden structure in the randomness of the prime number sequence?, arXiv:cond-mat/0310148 [cond-mat.stat-mech], 2003-2005.
József Beck, Inevitable randomness in discrete mathematics, University Lecture Series, 49. American Mathematical Society, Providence, RI, 2009. xii+250 pp. ISBN: 978-0-8218-4756-5; MR2543141 (2010m:60026). See page 7.
Chris K. Caldwell, Prime k-tuple conjecture, Prime Pages' Glossary entry.
Joel E. Cohen and Dexter Senft, Gaps of size 2, 4, and (conditionally) 6 between successive odd composite numbers occur infinitely often, Notes on Number Theory and Discrete Mathematics, Volume 31, Number 3, 494-503 (2025). See p. 495.
Péter L. Erdős, Gergely Harcos, Shubha R. Kharel, Péter Maga, Tamás Róbert Mezei and Zoltán Toroczkai, The sequence of prime gaps is graphic, Mathematische Annalen 388 (2024), 2195-2215.
D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yildirim, Small gaps between primes and almost primes, arXiv:math/0506067 [math.NT], 2005.
D. A. Goldston and A. H. Ledoan, On the differences between consecutive prime numbers, I", arXiv:1111.3380v1 [math.NT], Nov 14, 2011.
D. A. Goldston, J. Pintz, and C. Y. Yildirim, Positive Proportion of Small Gaps Between Consecutive Primes, arXiv:1103.3986 [math.NT], Mar 21, 2011.
D. R. Heath-Brown and H. Iwaniec, On the difference between consecutive primes, Bull. Amer. Math. Soc. 1 (1979), 758-760.
Alexei Kourbatov, Tables of record gaps between prime constellations, arXiv preprint arXiv:1309.4053 [math.NT], 2013.
Alexei Kourbatov, The distribution of maximal prime gaps in Cramer's probabilistic model of primes, arXiv preprint arXiv:1401.6959 [math.NT], 2014.
The Polymath project, Bounded gaps between primes
Carlos Rivera, Conjecture 82. Average of log Dn / log(logPn) equal R = 0,877 08..., The Prime Puzzles & Problems Connection.
Hisanobu Shinya, On the density of prime differences less than a given magnitude which satisfy a certain inequality, arXiv:0809.3458 [math.GM], 2008-2011.
K. Soundararajan, Small gaps between prime numbers: the work of Goldston-Pintz-Yildirim, Bull. Amer. Math. Soc., 44 (2007), 1-18.
Eric Weisstein's World of Mathematics, Andrica's Conjecture
Eric Weisstein's World of Mathematics, Prime Difference Function
Yasuo Yamasaki and Aiichi Yamasaki, On the Gap Distribution of Prime Numbers, Kyoto University Research Information Repository, October 1994. MR1370273 (97a:11141).
Yitang Zhang, Bounded gaps between primes, Annals of Mathematics 179 (2014), 1121-1174.
Index entries for primes, gaps between

Cf. A000040 (primes), A001248 (primes squared), A000720, A037201, A007921, A030173, A036263-A036274, A167770, A008347.
Second difference is A036263, first occurrence is A000230.
For records see A005250, A005669.
Cf. A038664, A031131, A031165, A031166, A031167, A031168, A031169, A031170, A031171, A031172.
Cf. A174349, A029707, A029709, A320701, ..., A320720.
Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

a001223 n = a001223_list !! (n-1)
a001223_list = zipWith (-) (tail a000040_list) a000040_list
-- Reinhard Zumkeller, Oct 29 2011

[(NthPrime(n+1) - NthPrime(n)): n in [1..100]]; // Vincenzo Librandi, Apr 02 2011

with(numtheory): for n from 1 to 500 do printf(`%d,`,ithprime(n+1) - ithprime(n)) od:

Differences[Prime[Range[100]]] (* Harvey P. Dale, May 15 2011 *)

diff(v)=vector(#v-1,i,v[i+1]-v[i]);
diff(primes(100)) \\ Charles R Greathouse IV, Feb 11 2011

forprime(p=1, 1e3, print1(nextprime(p+1)-p, ", ")) \\ Felix Fröhlich, Sep 06 2014

from sympy import prime
def A001223(n): return prime(n+1)-prime(n) # Chai Wah Wu, Jul 07 2022

differences(prime_range(1000)) # Joerg Arndt, May 15 2011

G.f.: b(x)*(1-x), where b(x) is the g.f. for the primes. - Franklin T. Adams-Watters, Jun 15 2006
a(n) = prime(n+1) - prime(n). - Franklin T. Adams-Watters, Mar 31 2010
Conjectures: (i) a(n) = ceiling(prime(n)*log(prime(n+1)/prime(n))). (ii) a(n) = floor(prime(n+1)*log(prime(n+1)/prime(n))). (iii) a(n) = floor((prime(n)+prime(n+1))*log(prime(n+1)/prime(n))/2). - Thomas Ordowski, Mar 21 2013
A167770(n) == a(n)^2 (mod A000040(n+1)). - L. Edson Jeffery, Oct 01 2014
a(n) = Sum_{k=1..2^(n+1)-1} (floor(cos^2(Pi*(n+1)^(1/(n+1))/(1+primepi(k))^(1/(n+1))))). - Anthony Browne, May 11 2016
G.f.: (Sum_{k>=1} x^pi(k)) - 1, where pi(k) is the prime counting function. - Benedict W. J. Irwin, Jun 13 2016
Conjecture: Limit_{N->oo} (Sum_{n=2..N} log(a(n))) / (Sum_{n=2..N} log(log(prime(n)))) = 1. - Alain Rocchelli, Dec 16 2022
Conjecture: The asymptotic limit of the average of log(a(n)) ~ log(log(prime(n))) - gamma (where gamma is Euler's constant). Also, for n tending to infinity, the geometric mean of a(n) is equivalent to log(prime(n)) / e^gamma. - Alain Rocchelli, Jan 23 2023
It has been conjectured that primes are distributed around their average spacing in a Poisson distribution (cf. D. A. Goldston in above links). This is the basis of the last two conjectures above. - Alain Rocchelli, Feb 10 2023

More terms from James Sellers, Feb 19 2001

A028334 Differences between consecutive odd primes, divided by 2.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 3, 1, 3, 2, 1, 2, 3, 3, 1, 3, 2, 1, 3, 2, 3, 4, 2, 1, 2, 1, 2, 7, 2, 3, 1, 5, 1, 3, 3, 2, 3, 3, 1, 5, 1, 2, 1, 6, 6, 2, 1, 2, 3, 1, 5, 3, 3, 3, 1, 3, 2, 1, 5, 7, 2, 1, 2, 7, 3, 5, 1, 2, 3, 4, 3, 3, 2, 3, 4, 2, 4, 5, 1, 5, 1, 3, 2, 3, 4, 2, 1, 2, 6, 4, 2, 4, 2, 3, 6, 1, 9, 3, 5, 3, 3, 1, 3

Offset: 2

N. J. A. Sloane

nonn

With an initial zero, gives the numbers of even numbers between two successive primes. - Giovanni Teofilatto, Nov 04 2005
Equal to difference between terms in A067076. - Eric Desbiaux, Aug 07 2010
The twin prime conjecture is that a(n) = 1 infinitely often. Yitang Zhang has proved that a(n) < 3.5 x 10^7 infinitely often. - Jonathan Sondow, May 17 2013
a(n) = 1 if, and only if, n + 1 is in A107770. - Jason Kimberley, Nov 13 2015

			23 - 19 = 4, so a(8) = 4/2 = 2.
29 - 23 = 6, so a(9) = 6/2 = 3.
31 - 29 = 2, so a(10) = 2/2 = 1.

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 2..10000
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Yitang Zhang, Bounded gaps between primes, Annals of Mathematics, Pages 1121-1174 from Volume 179 (2014), Issue 3.

Cf. A005521.
Cf. A000230 (least prime with a gap of 2n to the next prime).
Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556 - A330561.

[(NthPrime(n+1)-NthPrime(n))/2: n in [2..100]]; // Vincenzo Librandi, Dec 12 2016

Table[(Prime[n + 1] - Prime[n])/2, {n, 2, 105}] (* Robert G. Wilson v *)
Differences[Prime[Range[2, 110]]]/2 (* Harvey P. Dale, Jan 25 2015 *)

vector(10000,i,(prime(i+2)-prime(i+1))/2) \\ Stanislav Sykora, Nov 05 2014

def A028334(n): return (nth_prime(n+1) - nth_prime(n))//2
[A028334(n) for n in range(2,101)] # G. C. Greubel, Jul 17 2024

a(n) = A001223(n)/2 for n > 1.
a(n) = (prime(n+1) - prime(n)) / 2, where prime(n) is the n-th prime.
a(n) = A047160(A024675(n-1)). - Jason Kimberley, Nov 12 2015
G.f.: (b(x)/((x + 1)/((1 - x)) - 1) - 1 - x/2)/x, where b(x) is the g.f. of A000040. - Mario C. Enriquez, Dec 10 2016

Replaced multiplication by division in the cross-reference R. J. Mathar, Jan 23 2010
Definition corrected by Jonathan Sondow, May 17 2013
Edited by Franklin T. Adams-Watters, Aug 07 2014

A104120 a(n) = (prime(n + 1) - prime(n))/2 (mod 2).

Original entry on oeis.org

1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1

Offset: 2

Joseph L. Pe, Mar 06 2005

Questions: Is s(n) = (1/n)*Sum_{i=2..n+1} a(i) > 1/2 for all n? Does s(n) --> 1/2?

			a(1) = (prime(2 + 1) - prime(2))/2 (mod 2) = (5 - 3)/2 (mod 2) = 1 mod 2 = 1.

Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

Table[Mod[(Prime[i + 1] - Prime[i])/2, 2], {i, 2, 100}]
Mod[(#[[2]]-#[[1]])/2,2]&/@Partition[Prime[Range[2,110]],2,1] (* Harvey P. Dale, Oct 01 2018 *)

A330556 a(n) = (number of primes p <= 2n+1 with Delta(p) == 2 mod 4) - (number of primes p <= 2n+1 with Delta(p) == 0 mod 4), where Delta(p) = nextprime(p) - p.

Original entry on oeis.org

0, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 3, 4, 4, 4, 3, 3, 4, 3, 3, 4, 4, 4, 5, 5, 5, 6, 7, 7, 7, 6, 6, 7, 8, 8, 8, 7, 7, 8, 8, 8, 7, 7, 7, 7, 6, 6, 7, 6, 6, 7, 6, 6, 7, 7, 7, 7, 7, 7, 7, 6, 6, 7, 7, 7, 8, 9, 9, 9, 9, 9, 10, 11, 11, 11, 12, 12, 12, 11, 11, 12, 12, 12, 13, 13, 13

Offset: 0

N. J. A. Sloane, Dec 29 2019

nonn

a(n) = A330557(n) - A330558(n).

Since Delta(prime(n)) grows roughly like log n, this probably changes sign infinitely often. When is the next time a(n) is zero, or the first time a(n) < 0 (if these values exist)?

			n=5, 2*n+1=11: there are three primes <= 11 with Delta(p) == 2 mod 4, namely 3,5,11; and one with Delta(p) == 0 mod 4, namely 7; so a(5) = 3-1 = 2.

N. J. A. Sloane, Table of n, a(n) for n = 0..99999
StackExchange, Asymptotic Distribution of Prime Gaps in Residue Classes.

Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

A330561 a(n) = number of primes p <= prime(n) with Delta(p) == 0 (mod 4), where Delta(p) = nextprime(p) - p.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 16, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 21, 22, 22, 23, 23, 23, 24, 24, 25, 26, 27, 27, 27, 27, 27

Offset: 1

N. J. A. Sloane, Dec 30 2019

nonn

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A098059.

Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556, A330557, A330558, A330559, A330560.

[#[p:p in PrimesInInterval(1,NthPrime(n))|IsIntegral((NextPrime(p)-p)/4)]:n in [1..80]]; // Marius A. Burtea, Dec 31 2019

N:= 200: # for a(1)..a(N)
P:= [seq(ithprime(i),i=1..N+1)]:
Delta:= P[2..-1]-P[1..-2] mod 4:
R:= map(charfcn[0],Delta):
ListTools:-PartialSums(R); # Robert Israel, Dec 31 2019

Accumulate[Map[Boole[Mod[#, 4] == 0]&, Differences[Prime[Range[100]]]]] (* Paolo Xausa, Feb 05 2024 *)

A330557 a(n) = number of primes p <= 2*n+1 with Delta(p) == 2 mod 4, where Delta(p) = nextprime(p) - p.

Original entry on oeis.org

0, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 12, 12, 12, 12, 12, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 20, 21, 21

Offset: 0

N. J. A. Sloane, Dec 29 2019

nonn

Robert Israel, Table of n, a(n) for n = 0..10000

Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

[#[p:p in PrimesInInterval(1,2*n+1)| (NextPrime(p)-p) mod 4 eq 2]:n in [0..80]]; // Marius A. Burtea, Dec 31 2019

N:= 100: # for a(0)..a(N)
P:= select(isprime, [seq(i,i=3..nextprime(2*N+1),2)]):
Delta:= P[2..-1]-P[1..-2] mod 4:
A:= Array(0..N): t:= 0: j:= 1:
for n from 0 to N do
  m:= 2*n+1:
  if m = P[j] then t:= t + charfcn[2](Delta[j]); j:= j+1 fi;
  A[n]:= t
od:
convert(A,list); # Robert Israel, Dec 31 2019

A330558 a(n) = number of primes p <= 2*n+1 with Delta(p) == 0 mod 4, where Delta(p) = nextprime(p) - p.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12

Offset: 0

N. J. A. Sloane, Dec 29 2019

nonn

Robert Israel, Table of n, a(n) for n = 0..10000

Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

[#[p:p in PrimesInInterval(1,2*n+1)| (NextPrime(p)-p) mod 4 eq 0]:n in [0..80]]; // Marius A. Burtea, Dec 31 2019

N:= 100: # for a(0)..a(N)
P:= select(isprime, [seq(i,i=3..nextprime(2*N+1),2)]):
Delta:= P[2..-1]-P[1..-2] mod 4:
A:= Array(0..N): t:= 0: j:= 1:
for n from 0 to N do
m:= 2*n+1:
if m = P[j] then t:= t + charfcn[0](Delta[j]); j:= j+1 fi;
A[n]:= t
od:
convert(A,list); # Robert Israel, Dec 31 2019

cp's OEIS Frontend

A080379 Least n such that n consecutive values in A080378 equals 2; i.e., exactly n differences between consecutive primes give residues 2 when divided by 4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A080380 Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions

A259396 Length of runs of identical terms in A080378.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

A001223 Prime gaps: differences between consecutive primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

Extensions

A028334 Differences between consecutive odd primes, divided by 2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A104120 a(n) = (prime(n + 1) - prime(n))/2 (mod 2).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330556 a(n) = (number of primes p <= 2*n+1 with Delta(p) == 2 mod 4) - (number of primes p <= 2*n+1 with Delta(p) == 0 mod 4), where Delta(p) = nextprime(p) - p.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A330556 a(n) = (number of primes p <= 2n+1 with Delta(p) == 2 mod 4) - (number of primes p <= 2n+1 with Delta(p) == 0 mod 4), where Delta(p) = nextprime(p) - p.