A132234 -id:A132234 - cp's OEIS frontend

A030433 Primes of form 10*k + 9.

19, 29, 59, 79, 89, 109, 139, 149, 179, 199, 229, 239, 269, 349, 359, 379, 389, 409, 419, 439, 449, 479, 499, 509, 569, 599, 619, 659, 709, 719, 739, 769, 809, 829, 839, 859, 919, 929, 1009, 1019, 1039, 1049, 1069, 1109, 1129, 1229, 1249, 1259, 1279, 1289

Offset: 1

Warut Roonguthai

nonn

Also primes of form 5*k + 4.
5 is quadratic residue of primes of form 10*k-1. - Vincenzo Librandi, Jun 25 2014
Also, primes p such that 5 divides sigma(p), cf. A274397. - M. F. Hasler, Jul 10 2016
Conjecture: Primes p such that ((x+1)^5-1)/x has 2 distinct irreducible factors of degree 2 over GF(p). - Federico Provvedi, Apr 01 2018
The digital root of a(n) is 1, 2, 4, 5, 7 or 8. - Muniru A Asiru, Apr 28 2018
From Jianing Song, Sep 13 2022: (Start)
Primes p such that the ideal (p) factors into two prime ideals in Z[zeta_5], where zeta_5 = exp(2*Pi*i/5). Since Z[zeta_5] is a PID, this is equivalent to saying that this sequence lists primes p that are the product of two non-associate prime elements Z[zeta_5]. In particular, the factorization of p == 4 (mod 5) in Z[zeta_5] coincides with the factorization in Z[(1+sqrt(5))/2] (e.g., 19 = (8+3*sqrt(5))*(8-3*sqrt(5)) is the factorization of 19 in both Z[(1+sqrt(5))/2] and Z[zeta_5]).
Also primes p such that x^4 + x^3 + x^2 + x + 1 factors into two irreducible quadratic polynomials over GF(p) (cf. A327753). (End)

Michael B. Porter, Table of n, a(n) for n = 1..100000
A. Granville and G. Martin, Prime number races, arXiv:math/0408319 [math.NT], 2004.
Erika Klarreich, Mathematicians Discover Prime Conspiracy, Quanta Magazine, 2016.
R. J. Lemke Oliver and K. Soundararajan, Unexpected biases in the distribution of consecutive primes, arXiv:1603.03720 [math.NT], 2016.

Cf. A045457, A049510, A102700.

Filtered(List([1..500],n->10*n+9),IsPrime); # Muniru A Asiru, Apr 27 2018

select(isprime,[seq(10*n+9,n=1..500)]); # Muniru A Asiru, Apr 27 2018

Select[Prime@Range[210], Mod[ #, 10] == 9 &] (* Ray Chandler, Nov 07 2006 *)
Select[Range[9, 1300, 10], PrimeQ] (* Harvey P. Dale, Jun 01 2012 *)
Prime@Flatten@Position[Length@FactorList[((1+d)^5-1)/d,Modulus->#]&/@Prime@Range@200,3] (* Federico Provvedi, Apr 04 2018 *)

select(n->n%10==9, primes(100)) \\ Charles R Greathouse IV, Apr 29 2015

for(n=1, 1e3, if(isprime(p=10*n+9), print1(p, ", "))); \\ Altug Alkan, Apr 19 2018

a(n) = 10*A102700(n) + 9.
Union of A132234 and A132236. - Ray Chandler, Apr 07 2009
Intersection of A000040 and A017377. - Iain Fox, Dec 30 2017

Extended by Ray Chandler, Nov 07 2006

A132232 Primes congruent to 11 (mod 30).

Original entry on oeis.org

11, 41, 71, 101, 131, 191, 251, 281, 311, 401, 431, 461, 491, 521, 641, 701, 761, 821, 881, 911, 941, 971, 1031, 1061, 1091, 1151, 1181, 1301, 1361, 1451, 1481, 1511, 1571, 1601, 1721, 1811, 1871, 1901, 1931, 2081, 2111, 2141, 2351, 2381, 2411, 2441, 2531

Offset: 1

Omar E. Pol, Aug 15 2007

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
C. K. Caldwell, The Prime Pages.
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.

Cf. A000040, A068231, A039949.

Cf. A132230, A132231, A132233, A132234, A132235, A132236.

[p: p in PrimesUpTo(3000) | p mod 30 eq 11 ]; // Vincenzo Librandi, Aug 14 2012

Select[Prime[Range[1000]],MemberQ[{11},Mod[#,30]]&] (* Vincenzo Librandi, Aug 14 2012 *)
Select[Range[11,2600,30],PrimeQ] (* Harvey P. Dale, Mar 07 2020 *)

is(n)=isprime(n) && n%30==11 \\ Charles R Greathouse IV, Jul 01 2016

From Ray Chandler, Apr 07 2009: (Start)
a(n) = A158614(n)*30 + 11.
Intersection of A030430 and A007528. (End)

Extended by Ray Chandler, Apr 07 2009

A132235 Primes congruent to 23 (mod 30).

Original entry on oeis.org

23, 53, 83, 113, 173, 233, 263, 293, 353, 383, 443, 503, 563, 593, 653, 683, 743, 773, 863, 953, 983, 1013, 1103, 1163, 1193, 1223, 1283, 1373, 1433, 1493, 1523, 1553, 1583, 1613, 1733, 1823, 1913, 1973, 2003, 2063, 2153, 2213, 2243, 2273, 2333, 2393

Offset: 1

Omar E. Pol, Aug 15 2007

Primes (excluding 3) ending in 3 with (SOD-1)/3 non-integer where SOD is sum of digits. - Ki Punches
The sequence is infinite by Dirichlet's theorem. - Arkadiusz Wesolowski, Apr 02 2014
Terms are non-twin primes A007510. - Omar E. Pol, Jul 25 2019

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
C. K. Caldwell, The Prime Pages.
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Omar E. Pol, Prime numbers in a sieve with 30 columns

Cf. A000040, A039949.

Cf. A132230, A132231, A132232, A132233, A132234, A132236.

[p: p in PrimesUpTo(3000) | p mod 30 eq 23 ]; // Vincenzo Librandi, Aug 14 2012

Select[Prime[Range[1000]],MemberQ[{23},Mod[#,30]]&] (* Vincenzo Librandi, Aug 14 2012 *)
Select[Range[23,2400,30],PrimeQ] (* Harvey P. Dale, Jan 27 2020 *)

is(n)=isprime(n) && n%30==23 \\ Charles R Greathouse IV, Jul 01 2016

a(n) = A158791(n)*30 + 23. - Ray Chandler, Apr 07 2009

Intersection of A030431 and A007528. - Ray Chandler, Apr 07 2009

Extended by Ray Chandler, Apr 07 2009

A158806 Numbers n such that 30*n + 19 is prime.

Original entry on oeis.org

0, 2, 3, 4, 6, 7, 11, 12, 13, 14, 16, 20, 23, 24, 25, 27, 28, 30, 33, 34, 35, 37, 41, 42, 46, 47, 48, 49, 51, 52, 53, 55, 56, 58, 59, 62, 66, 67, 69, 72, 74, 75, 79, 84, 88, 89, 90, 91, 100, 101, 102, 103, 105, 107, 108, 110, 115, 116, 117, 118, 123, 124, 125, 129, 130

Offset: 1

Ki Punches, Mar 27 2009

nonn

Encoded primes with LSD 9, (SOD-1)/3 integer, (LSD, least significant digit; SOD, sum of digits). Divide any such number by 30, if the whole number portion of the quotient is in the sequence, the number is prime.

			Example: 3019, with LSD 9, (SOD-1)/3 integer; Then 3019/30 = 100.633, or 100, which is in the sequence, thus 3019 is prime.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A111175, A158573, A158614, A158648, A158746, A158791, A158850.

Select[Range[0,150],PrimeQ[30#+19]&] (* Harvey P. Dale, Apr 05 2025 *)

is(n)=isprime(30*n+19) \\ Charles R Greathouse IV, Feb 17 2017

a(n) = (A132234(n) - 19)/30 = Floor[A132234(n)/30]. - Chandler

Edited by Ray Chandler, Apr 07 2009

A132247 Twin primes congruent to {1, 11, 13, 17, 19, 29} mod 30.

Original entry on oeis.org

11, 13, 17, 19, 29, 31, 41, 43, 59, 61, 71, 73, 101, 103, 107, 109, 137, 139, 149, 151, 179, 181, 191, 193, 197, 199, 227, 229, 239, 241, 269, 271, 281, 283, 311, 313, 347, 349, 419, 421, 431, 433, 461, 463, 521, 523, 569, 571, 599, 601, 617, 619, 641, 643

Offset: 1

Omar E. Pol, Aug 18 2007

Twin primes that are greater than 7. - Omar E. Pol, Oct 31 2013

C. K. Caldwell, The Prime Pages
C. K. Caldwell, Twin Primes
Omar E. Pol, Prime numbers in a sieve with 30 columns
Omar E. Pol, Sobre el patrón de los números primos

Cf. A001097, A039949, A132230, A132232-A132234, A132236, A132238-A132246, A132248-A132259.

a(n) = A001097(n+3). - Michel Marcus, Nov 03 2013

A282324 Greater of twin primes congruent to 19 (mod 30).

Original entry on oeis.org

19, 109, 139, 199, 229, 349, 619, 829, 859, 1279, 1429, 1489, 1609, 1669, 1699, 1789, 1879, 1999, 2029, 2089, 2239, 2269, 2659, 2689, 3169, 3259, 3469, 3529, 3559, 3769, 3919, 4129, 4159, 4219, 4339, 4519, 4549, 4639, 4789, 4969, 5419, 5479, 5659, 5869, 6199

Offset: 1

Martin Renner, Feb 11 2017

nonn

The union of [A282323 and this sequence] is A132242.
The union of [{5, 7}, A282322, this sequence and A282326] is the greater of twin primes sequence A006512.
The union of [{3, 5, 7}, A282321 to A282326] is the twin primes sequence A001097.
Number of terms less than 10^k, k=2,3,4,...: 1, 9, 64, 414, 2734, 19674, 146953, ... - Muniru A Asiru, Feb 09 2018

Muniru A Asiru, Table of n, a(n) for n = 1..2000

Subset of A001097, A006512, A132234, A132242 and A132247.

Cf. A001359, A132235, A132236, A232880, A232881, A232882, A282321, A282322, A282323, A060229, A282326.

Filtered(List([1..220], k -> 30*k-11), n -> IsPrime(n) and IsPrime(n-2));  # Muniru A Asiru, Feb 02 2018

[p: p in PrimesUpTo(7000) | IsPrime(p-2) and p mod 30 eq 19 ]; // Vincenzo Librandi, Feb 13 2017

a:={}:
for i from 1 to 1229 do
  if isprime(ithprime(i)-2) and ithprime(i) mod 30 = 19 then
    a:={op(a),ithprime(i)}:
  fi:
od:
a;
# More efficient
select(n -> isprime(n-2) and isprime(n), [seq(30*k+19, k=0..220)]); # Muniru A Asiru, Jan 30 2018

Select[Prime[Range[1000]], PrimeQ[# - 2] && Mod[#, 30] == 19 &] (* Vincenzo Librandi, Feb 13 2017 *)

list(lim)=my(v=List(), p=2); forprime(q=3, lim, if(q-p==2 && q%30==19, listput(v, q)); p=q); Vec(v) \\ Charles R Greathouse IV, Feb 14 2017

A140378 Lengths of runs of consecutive primes and nonprimes in A007775.

Original entry on oeis.org

1, 12, 1, 6, 1, 3, 1, 6, 2, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 4, 2, 1, 2, 6, 1, 1, 1, 1, 1, 6, 2, 1, 2, 4, 3, 2, 2, 4, 1, 1, 1, 1, 1, 3, 1, 2, 2, 1, 1, 2, 1, 2, 1, 3, 1, 4, 2, 1, 1, 2, 2, 3, 2, 2, 4, 2, 2, 1, 1, 4, 2, 1, 1, 4, 1, 3, 2, 1, 1, 3, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 2

Offset: 1

Juri-Stepan Gerasimov, Jun 13 2008

nonn

Primes can be classified according to their remainder modulo 30: remainder 1 (A136066), 7 (A132231), 11 (A132232), 13 (A132233), 17 (A039949), 19 (A132234), 23 (A132235), or 29 (A132236). In the sequence A007775 of all numbers (prime or nonprime) in any of these remainder classes, we look for runs of numbers that are successively prime or nonprime and place the lengths of these runs in this sequence.

			Groups of runs in A007775 are (1), (7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47), (49), (53, 59, 61, 67, 71, 73), (77), (79, 83,...), which is 1 nonprime followed by 12 primes followed by 1 nonprime followed by 6 primes etc.

Cf. A136066, A132231, A132232, A132233, A039919, A132234, A132235, A132236.

A007775 := proc(n) option remember ; local a; if n = 1 then 1; else for a from A007775(n-1)+1 do if a mod 2 <>0 and a mod 3 <>0 and a mod 5 <> 0 then RETURN(a) ; fi ; od: fi ; end: A := proc() local al,isp,n; al := 0: isp := false ; n := 1: while n< 300 do a := A007775(n) ; if isprime(a) <> isp then printf("%d,",al) ; al := 1; isp := not isp ; else al := al+1 ; fi ; n := n+1: od: end: A() ; # R. J. Mathar, Jun 16 2008

Edited by R. J. Mathar, Jun 16 2008

A140387 Binary encoding of the location of primes in integer sets r+30*n with remainder r=1,7,11,..,29.

Original entry on oeis.org

1, 32, 16, 129, 73, 36, 194, 6, 42, 176, 225, 12, 21, 89, 18, 97, 25, 243, 44, 44, 196, 34, 166, 90, 149, 152, 109, 66, 135, 225, 89, 169, 169, 28, 82, 210, 33, 213, 179, 170, 38, 92, 15, 96, 252, 171, 94, 7, 209, 2, 187, 22, 153, 9, 236, 197, 71, 179, 212, 197, 186

Offset: 1

Juri-Stepan Gerasimov, Jun 10 2008

Classify all integers 30n+r with r= 1, 7, 11, 13, 17, 19, 23 or 29 as nonprime or prime and assign bit positions 0=LSB, 1, 2, 3, .., 7=MSB to the 8 remainders in the same order. Raise the bit if 30n+r is nonprime, erase it if 30n+r is prime.

The sequence interprets this as a number in base 2 and shows the decimal representation.

			For n=1, the 8 numbers 31 (r=1), 37 (r=7), 41 (r=11), 43 (r=17), 47 (r=17), 49 (r=19), 53 (r=23) and 59 (r=29) are prime, prime, prime, prime, prime, nonprime, prime, prime, prime, which is rendered into the binary 000100000 = 2^5=32=a(1).

Cf. A132236, A132235, A132234, A039919, A132233, A132232, A136066, A140378.

Cf. A105052 (analog in base 10, prime = bit 1, remainder 1 = MSB), A140891 (analog in base 14, prime = bit 0, remainder 1 = LSB).

Edited by R. J. Mathar, Jun 17 2008

A229947 Primes congruent to {1, 11, 13, 17, 19, 29} mod 30.

Original entry on oeis.org

11, 13, 17, 19, 29, 31, 41, 43, 47, 59, 61, 71, 73, 79, 89, 101, 103, 107, 109, 131, 137, 139, 149, 151, 163, 167, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 239, 241, 251, 257, 269, 271, 281, 283, 311, 313, 317, 331, 347, 349, 359, 373, 379, 389

Offset: 1

Omar E. Pol, Oct 27 2013

For twin primes congruent to {1, 11, 13, 17, 19, 29} mod 30 see A132247.

Complement of A132237, primes congruent to 7 or 23 (mod 30), in the set of primes > 5. - M. F. Hasler, Nov 02 2013

Omar E. Pol, Prime numbers in a sieve with 30 columns

Cf. A000040, A001097, A039949, A132230, A132232-A132234, A132236, A132238-A132259, A230462.

[p: p in PrimesUpTo(500) | p mod 30 in {1,11,13,17, 19,29} ]; // Vincenzo Librandi, Apr 05 2015

Select[Flatten[Table[30n + {1, 11, 13, 17, 19, 29}, {n, 0, 11}]], PrimeQ] (* Alonso del Arte, Nov 01 2013 *)
Select[Prime@Range[100], MemberQ[{1, 11, 13, 17, 19, 29}, Mod[#, 30]] &] (* Vincenzo Librandi, Apr 05 2015 *)

is(n)=isprime(n) && setsearch([1,11,13,17,19,29], n%30) \\ Charles R Greathouse IV, Mar 08 2015

a(n) ~ 4/3 n log n. - Charles R Greathouse IV, Mar 08 2015

cp's OEIS Frontend

A030433 Primes of form 10*k + 9.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Maple

Mathematica

PARI

PARI

Formula

Extensions

A132232 Primes congruent to 11 (mod 30).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A132235 Primes congruent to 23 (mod 30).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A158806 Numbers n such that 30*n + 19 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A132247 Twin primes congruent to {1, 11, 13, 17, 19, 29} mod 30.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A282324 Greater of twin primes congruent to 19 (mod 30).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

A140378 Lengths of runs of consecutive primes and nonprimes in A007775.

Views

Author

Keywords

Comments