A052198 -id:A052198 - cp's OEIS frontend

A047948 Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.

47, 151, 167, 251, 257, 367, 557, 587, 601, 647, 727, 941, 971, 1097, 1117, 1181, 1217, 1361, 1741, 1747, 1901, 2281, 2411, 2671, 2897, 2957, 3301, 3307, 3631, 3727, 4007, 4451, 4591, 4651, 4987, 5101, 5107, 5297, 5381, 5387, 5557, 5801, 6067, 6257, 6311, 6317

Offset: 1

Enoch Haga

Let p(k) be the k-th prime; sequence gives p(k) such that p(k+2) - p(k+1) = p(k+1) - p(k) = 6.

			47 is a term as the next two primes are 53 and 59.

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)

Subsequence of A031924.
A033451 (four consecutive primes with difference 6) is a subsequence.
Cf. A078853, A046789.
Cf. A001223, A033451, A052197, A052198.

ok[p_] := (q = NextPrime[p]) == p+6 && NextPrime[q] == q+6; Select[Prime /@ Range[1000], ok][[;; 45]] (* Jean-François Alcover, Jul 11 2011 *)
Transpose[Select[Partition[Prime[Range[1000]],3,1],Differences[#]=={6,6}&]] [[1]] (* Harvey P. Dale, Apr 25 2014 *)

is_A047948(n)={nextprime(n+1)==n+6 && nextprime(n+7)==n+12 && isprime(n)} \\ Charles R Greathouse IV, Aug 17 2011, simplified by M. F. Hasler, Jan 13 2013

p=2;q=3;forprime(r=5,1e4,if(r-p==12&&q-p==6,print1(p", "));p=q;q=r) \\ Charles R Greathouse IV, Aug 17 2011

Corrected by T. D. Noe, Mar 07 2008

A052378 Primes followed by a [4,2,4] prime difference pattern of A001223.

Original entry on oeis.org

7, 13, 37, 97, 103, 223, 307, 457, 853, 877, 1087, 1297, 1423, 1483, 1867, 1993, 2683, 3457, 4513, 4783, 5227, 5647, 6823, 7873, 8287, 10453, 13687, 13873, 15727, 16057, 16063, 16183, 17383, 19417, 19423, 20743, 21013, 21313, 22273, 23053, 23557

Offset: 1

Labos Elemer, Mar 22 2000

nonn

The sequence includes A052166, A052168, A022008 and also other primes like 13, 103, 16063 etc.
a(n) is the lesser term of a 4-twin (A023200) after which the next 4-twin comes in minimal distance [here it is 2; see A052380(4/2)].
Analogous prime sequences are A047948, A052376, A052377 and A052188-A052198 with various [d, A052380(d/2), d] difference patterns following a(n).
All terms == 1 (mod 6) - Zak Seidov, Aug 27 2012
Subsequence of A022005. - R. J. Mathar, May 06 2017

			103 initiates [103,107,109,113] prime quadruple followed by [4,2,4] difference pattern.

Zak Seidov, Table of n, a(n) for n = 1..2000

Cf. A023200, A053320, A022008, A052166, A052168, A001223, A052380.

a = {}; Do[If[Prime[x + 3] - Prime[x] == 10, AppendTo[a, Prime[x]]], {x, 1, 10000}]; a (* Zerinvary Lajos, Apr 03 2007 *)
Select[Partition[Prime[Range[3000]],4,1],Differences[#]=={4,2,4}&][[All,1]] (* Harvey P. Dale, Jun 16 2017 *)

is(n)=n%6==1 && isprime(n+4) && isprime(n+6) && isprime(n+10) && isprime(n) \\ Charles R Greathouse IV, Apr 29 2015

a(n) is the initial prime of a [p, p+4, p+6, p+6+4] prime-quadruple consisting of two 4-twins: [p, p+4] and [p+6, p+10].

A122535 Smallest prime of a triple of successive primes, where the middle one is the arithmetic mean of the other two.

Original entry on oeis.org

3, 47, 151, 167, 199, 251, 257, 367, 557, 587, 601, 647, 727, 941, 971, 1097, 1117, 1181, 1217, 1361, 1499, 1741, 1747, 1901, 2281, 2411, 2671, 2897, 2957, 3301, 3307, 3631, 3727, 4007, 4397, 4451, 4591, 4651, 4679, 4987, 5101, 5107, 5297, 5381, 5387

Offset: 1

Miklos Kristof, Sep 18 2006

nonn

Subsets are A047948, A052188, A052189, A052190, A052195, A052197, A052198, etc. - R. J. Mathar, Apr 11 2008
Could be generated by searching for cases A001223(i) = A001223(i+1), writing down A000040(i). - R. J. Mathar, Dec 20 2008
a(n) = A006562(n) - A117217(n). - Zak Seidov, Feb 12 2013
These are primes for which the subsequent prime gaps are equal, so (p(k+2)-p(k+1))/(p(k+1)-p(k)) = 1. It is conjectured that prime gaps ratios equal to one are less frequent than those equal to 1/2, 2, 3/2, 2/3, 1/3 and 3. - Andres Cicuttin, Nov 07 2016

			The prime 7 is not in the list, because in the triple (7, 11, 13) of successive primes, 11 is not equal (7 + 13)/2 = 10.
The second term, 47, is the first prime in the triple (47, 53, 59) of primes, where 53 is the mean of 47 and 59.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for sequences related to primes in arithmetic progressions

Cf. A006562, A062839, A102552, A117217, A181424.

a122535 = a000040 . a064113  -- Reinhard Zumkeller, Jan 20 2012

Clear[d2, d1, k]; d2[n_] = Prime[n + 2] - 2*Prime[n + 1] + Prime[n]; d1[n_] = Prime[n + 1] - Prime[n]; k[n_] = -d2[n]/(1 + d1[n])^(3/2); Flatten[Table[If[k[n] == 0, Prime[n], {}], {n, 1, 1000}]] (* Roger L. Bagula, Nov 13 2008 *)
Transpose[Select[Partition[Prime[Range[750]], 3, 1], #[[2]] == (#[[1]] + #[[3]])/2 &]][[1]]  (* Harvey P. Dale, Jan 09 2011 *)

A122535()={n=3;ctr=0;while(ctr<50, avgg=( prime(n-2)+prime(n) )/2;
if( prime(n-1) ==avgg, ctr+=1;print( ctr,"  ",prime(n-2) )  );n+=1); } \\ Bill McEachen, Jan 19 2015

{A000040(i): A000040(i+1)= (A000040(i)+A000040(i+2))/2 }. - R. J. Mathar, Dec 20 2008

a(n) = A000040(A064113(n)). - Reinhard Zumkeller, Jan 20 2012

More terms from Roger L. Bagula, Nov 13 2008

Definition rephrased by R. J. Mathar, Dec 20 2008

A054643 Primes prime(n) such that prime(n) + prime(n+1) + prime(n+2) == 0 (mod 3).

Original entry on oeis.org

3, 47, 151, 167, 199, 251, 257, 367, 503, 523, 557, 587, 601, 647, 727, 941, 971, 991, 1063, 1097, 1117, 1181, 1217, 1231, 1361, 1453, 1493, 1499, 1531, 1741, 1747, 1753, 1759, 1889, 1901, 1907, 2063, 2161, 2281, 2393, 2399, 2411, 2441, 2671, 2897, 2957

Offset: 1

Labos Elemer, May 15 2000

nonn

The 2 differences of these 3 primes should be congruent of 6, except the first prime 3, for which 3 + 5 + 7 = 15 holds. Sequences like A047948, A052198 etc. are subsequences here.

			For prime(242) = 1531, the sum is 4623, the mean is 1541 and the successive differences are 6a=12 or 6b=6 resp.

Zak Seidov, Table of n, a(n) for n = 1..1000

Cf. A034961, A034707, A024675, A052288, A047948, A052198.
A122535 is a subsequence.
Cf. A075541 (for their indices).

Select[Partition[Prime@ Range@ 430, 3, 1], Divisible[Total@ #, 3] &][[All, 1]] (* Michael De Vlieger, Jun 29 2017 *)

A052187 a(n) is the smallest prime p such that p, p+d, and p+2d are consecutive primes where d = 2 for n = 1 and d = 6*(n-1) for n > 1.

Original entry on oeis.org

3, 47, 199, 20183, 16763, 69593, 255767, 247099, 3565931, 6314393, 4911251, 12012677, 23346737, 43607351, 34346203, 36598517, 51041957, 460475467, 652576321, 742585183, 530324329, 807620651, 2988119207, 12447231761, 383204539, 4470607951, 5007182707

Offset: 1

Labos Elemer, Jan 28 2000

nonn

The first term 3 is anomalous since for all others d is divisible by 6. These are minimal terms if in A047948 d=6 is replaced by possible differences: (2), 6, 12, 18, ..., 54, 60.

a(54) > 5*10^13, while a(55) = 46186474937633. - Giovanni Resta, Apr 08 2013

			a(2)=47 and it is the lower border of a dd pattern: 47[6 ]53[6 ]59. a(10)=6314393 and a(10)+54=6314447, a(10)+108=6314501 are consecutive primes and 6314393 is the smallest prime prior to a (54,54) difference pattern of A001223.

Jerry M Lagrou, Table of n, a(n) for n = 1..72 (terms 1..39 from Donovan Johnson, terms 40..53 from Giovanni Resta)

Cf. A001223, A047948, A052160, A054342.

Cf. A052188, A052189, A052195, A052196, A052197, A052198.

a = Table[0, {100}]; NextPrime[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = q = r = 0; Do[r = NextPrime[r]; If[r + p == 2q && r - q < 201 && a[[(r - q)/2]] == 0, a[[(r - q)/2]] = p]; p = q; q = r, {n, 1, 10^6}]; a (* Typos fixed by Zak Seidov, May 01 2020 *)

list(n)=ve=vector(n);ppp=2;pp=3;forprime(p=5,,d=p-pp;if(pp-ppp==d,i=d\6+1;if(i<=n&&ve[i]==0,ve[i]=ppp;print1(".");vecprod(ve)>0&&return(ve)));ppp=pp;pp=p) \\ Jeppe Stig Nielsen, Apr 17 2022

The least prime(k) such that prime(k+1) = (prime(k) + prime(k+2))/2 and prime(k+1) - prime(k) = d is either 2 or divisible by 6.

a(1) = A054342(1) - 2. For n>1, a(n) = A054342(n) - 6*(n-1). - Jeppe Stig Nielsen, Apr 16 2022

More terms from Labos Elemer, Jan 04 2002
More terms from Robert G. Wilson v, Jan 06 2002
Definition clarified by Harvey P. Dale, Aug 29 2012
a(23)-a(27) from Donovan Johnson, Aug 30 2012
Name edited by Jon E. Schoenfield, Nov 30 2023

A053077 Balanced primes separated from the next lower and next higher prime neighbors by 42.

Original entry on oeis.org

247141, 689509, 1008659, 1629809, 1658669, 2024689, 2751041, 2811761, 2880949, 2921819, 3264491, 3295069, 3311359, 3365491, 3555311, 3668461, 4059271, 4412141, 4440571, 4549351, 4619399, 4690261, 4802989, 4955221, 5115301

Offset: 1

Harvey P. Dale, Feb 25 2000

			247141 is separated from both the next lower prime and the next higher prime by 42.

Zak Seidov, Table of n, a (n) for n = 1..1000

Cf. A052198.

lst={};Do[p=Prime[n];If[p-Prime[n-1]==Prime[n+1]-p==6*7,AppendTo[lst,p]],{n,2,9!}];lst (* Vladimir Joseph Stephan Orlovsky, May 20 2010 *)

a(n) = A052198(n) + 42. - Sean A. Irvine, Dec 06 2021

A329578 First of three consecutive primes with common gap 48.

Original entry on oeis.org

3565931, 3653863, 3985903, 5425613, 5647361, 6126971, 6292081, 6532553, 7133983, 7360363, 7389493, 7700131, 7865833, 7956163, 8467903, 8708291, 8972701, 9203743, 9603361, 9863551, 10279813, 10971743, 11998391, 12225251, 12474251, 12620843, 12966881, 13288211, 13376261, 13543451

Offset: 1

M. F. Hasler, Jan 02 2020

nonn

Amiram Eldar, Table of n, a(n) for n = 1..10000
OEIS Wiki, Consecutive primes in arithmetic progression, updated Jan. 2020.

Subsequence of A134123 (first of two primes with common gap 48).
A067388 (first of four primes with common gap 48) is a subsequence.
Cf. A047948, A052188, A052189, A052190, A052195, A052197, A052198, A089234 (analog for gaps 2, 4, 6, 12, 18, 24, ..., 60).

[p:p in PrimesUpTo(14000000)| NextPrime(p)-p eq 48 and NextPrime(p+48)-p eq 96]; // Marius A. Burtea, Jan 03 2020

Select[Partition[Prime[Range[900000]],3,1],Differences[#]=={48,48}&] [[All,1]] (* Harvey P. Dale, Aug 23 2021 *)

vecextract( A134123, select(t->t==48, A134123[^1]-A134123[^-1], 1)) \\ Terms of A134123 with indices corresponding to first differences of 48: gives a(1..56) from A134123(1..10^4).

cp's OEIS Frontend

A047948 Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A052378 Primes followed by a [4,2,4] prime difference pattern of A001223.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A122535 Smallest prime of a triple of successive primes, where the middle one is the arithmetic mean of the other two.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A054643 Primes prime(n) such that prime(n) + prime(n+1) + prime(n+2) == 0 (mod 3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A052187 a(n) is the smallest prime p such that p, p+d, and p+2d are consecutive primes where d = 2 for n = 1 and d = 6*(n-1) for n > 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A053077 Balanced primes separated from the next lower and next higher prime neighbors by 42.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A329578 First of three consecutive primes with common gap 48.

Views

Author

Keywords

Links

Crossrefs

Programs