A039706 -id:A039706 - cp's OEIS frontend

A039710 a(n) = n-th prime modulo 12.

2, 3, 5, 7, 11, 1, 5, 7, 11, 5, 7, 1, 5, 7, 11, 5, 11, 1, 7, 11, 1, 7, 11, 5, 1, 5, 7, 11, 1, 5, 7, 11, 5, 7, 5, 7, 1, 7, 11, 5, 11, 1, 11, 1, 5, 7, 7, 7, 11, 1, 5, 11, 1, 11, 5, 11, 5, 7, 1, 5, 7, 5, 7, 11, 1, 5, 7, 1, 11, 1, 5, 11, 7, 1, 7, 11, 5, 1, 5, 1, 11

Offset: 1

Clark Kimberling

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A039701-A039706, A038194, A007652, A039709, A039711-A039715.

[p mod(12): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

seq(ithprime(n) mod 12, n=1..100); # Nathaniel Johnston, Jun 29 2011

Table[Mod[Prime[n], 12], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 12] (* Vincenzo Librandi, May 06 2014 *)

primes(100)%11 \\ Charles R Greathouse IV, Dec 12 2024

[mod(p, 12) for p in primes(500)] # Bruno Berselli, May 05 2014

Sum_k={1..n} a(k) ~ 6*n. - Amiram Eldar, Dec 11 2024

A039711 a(n) = n-th prime modulo 13.

Original entry on oeis.org

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

Offset: 1

Clark Kimberling

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A039701-A039706, A038194, A007652, A039709, A039710, A039712-A039715.

[p mod(13): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

seq(ithprime(n) mod 13, n=1..100); # Nathaniel Johnston, Jun 29 2011

Mod[ Prime@ Range@ 80, 13] (* Robert G. Wilson v, Mar 13 2011 *)

primes(1000)%13 \\ Charles R Greathouse IV, Mar 13 2011

[mod(p, 13) for p in primes(500)] # Bruno Berselli, May 05 2014

Sum_k={1..n} a(k) ~ (13/2)*n. - Amiram Eldar, Dec 11 2024

A039712 a(n) = n-th prime modulo 14.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 3, 5, 9, 1, 3, 9, 13, 1, 5, 11, 3, 5, 11, 1, 3, 9, 13, 5, 13, 3, 5, 9, 11, 1, 1, 5, 11, 13, 9, 11, 3, 9, 13, 5, 11, 13, 9, 11, 1, 3, 1, 13, 3, 5, 9, 1, 3, 13, 5, 11, 3, 5, 11, 1, 3, 13, 13, 3, 5, 9, 9, 1, 11, 13, 3, 9, 3, 9, 1, 5, 11, 5, 9

Offset: 1

Clark Kimberling

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A039701-A039706, A038194, A007652, A039709-A039711, A039713-A039715.

[p mod(14): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

seq(ithprime(n) mod 14, n=1..100); # Nathaniel Johnston, Jun 29 2011

Table[Mod[Prime[n], 14], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 14] (* Vincenzo Librandi, May 06 2014 *)

[mod(p, 14) for p in primes(500)] # Bruno Berselli, May 05 2014

Sum_k={1..n} a(k) ~ 7*n. - Amiram Eldar, Dec 12 2024

A039713 a(n) = n-th prime modulo 15.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 2, 4, 8, 14, 1, 7, 11, 13, 2, 8, 14, 1, 7, 11, 13, 4, 8, 14, 7, 11, 13, 2, 4, 8, 7, 11, 2, 4, 14, 1, 7, 13, 2, 8, 14, 1, 11, 13, 2, 4, 1, 13, 2, 4, 8, 14, 1, 11, 2, 8, 14, 1, 7, 11, 13, 8, 7, 11, 13, 2, 1, 7, 2, 4, 8, 14, 7, 13, 4, 8, 14, 7

Offset: 1

Clark Kimberling

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A039701-A039706, A038194, A007652, A039709-A039712, A039714, A039715.

[p mod(15): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

seq(ithprime(n) mod 15, n=1..100); # Nathaniel Johnston, Jun 29 2011

Table[Mod[Prime[n], 15], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 15] (* Vincenzo Librandi, May 06 2014 *)

[mod(p, 15) for p in primes(500)] # Bruno Berselli, May 05 2014

Sum_k={1..n} a(k) ~ (15/2)*n. - Amiram Eldar, Dec 12 2024

A039714 a(n) = n-th prime modulo 16.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 1, 3, 7, 13, 15, 5, 9, 11, 15, 5, 11, 13, 3, 7, 9, 15, 3, 9, 1, 5, 7, 11, 13, 1, 15, 3, 9, 11, 5, 7, 13, 3, 7, 13, 3, 5, 15, 1, 5, 7, 3, 15, 3, 5, 9, 15, 1, 11, 1, 7, 13, 15, 5, 9, 11, 5, 3, 7, 9, 13, 11, 1, 11, 13, 1, 7, 15, 5, 11, 15, 5

Offset: 1

Clark Kimberling

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A039701-A039706, A038194, A007652, A039709-A039713, A039715.

[p mod(16): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

seq(ithprime(n) mod 16, n=1..100); # Nathaniel Johnston, Jun 29 2011

Table[Mod[Prime[n], 16], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 16] (* Vincenzo Librandi, May 06 2014 *)

[mod(p, 16) for p in primes(500)] # Bruno Berselli, May 05 2014

Sum_k={1..n} a(k) ~ 8*n. - Amiram Eldar, Dec 12 2024

A257482 Numbers m such that prime(m) mod 8 == prime(m) mod 27.

Original entry on oeis.org

1, 2, 3, 4, 48, 84, 85, 119, 181, 211, 212, 213, 270, 296, 297, 326, 352, 353, 354, 378, 483, 484, 485, 513, 514, 539, 566, 591, 641, 665, 666, 691, 713, 739, 766, 790, 815, 816, 841, 864, 865, 890, 914, 936, 937, 960, 1007, 1029, 1054, 1055, 1076, 1077, 1104, 1105, 1151

Offset: 1

Zak Seidov, Apr 26 2015

nonn

Numbers n such that A039706(n)= A242125(n).

8 and 27 are first two cubes > 1.

			prime(48) = 223 = 7 (mod 8) == 7 mod(27).

Ivan Neretin, Table of n, a(n) for n = 1..10000

Cf. A000720, A039706, A242125.

[n: n in [1..1500] | NthPrime(n) mod 8 eq NthPrime(n) mod 27]; // Vincenzo Librandi, Apr 28 2015

Select[Range@ 1000, Mod[Prime@ #, 8] == Mod[Prime@ #, 27] &] (* Michael De Vlieger, Apr 27 2015 *)

isok(n) = (prime(n) % 8) == (prime(n) % 27); \\ Michel Marcus, May 08 2017

a(n) = A000720(A257483(n)).

More terms from Vincenzo Librandi, Apr 28 2015

A257483 Primes p such that (p mod 8) = (p mod 27).

Original entry on oeis.org

2, 3, 5, 7, 223, 433, 439, 653, 1087, 1297, 1301, 1303, 1733, 1949, 1951, 2161, 2377, 2381, 2383, 2593, 3457, 3461, 3463, 3673, 3677, 3889, 4111, 4327, 4759, 4969, 4973, 5189, 5407, 5623, 5839, 6053, 6269, 6271, 6481, 6701, 6703, 6917, 7129, 7349, 7351, 7561

Offset: 1

Zak Seidov, Apr 26 2015

a(n) is 2, 3 or of the form 216k + r where r is in {1, 5, 7} - David A. Corneth, May 26 2015

			223 == 7 (mod 8) == 7 (mod 27),  433 == 1 (mod 8) == 1 (mod 27).

David A. Corneth, Table of n, a(n) for n = 1..10000

Cf. A000040, A039706, A242125, A257482.

[p: p in PrimesUpTo(8000) | p mod 8  eq  p mod 27]; // Vincenzo Librandi, Apr 28 2015

select(isprime,[2,3,seq(seq(216*k+r,r=[1,5,7]),k=0..1000)]); # Robert Israel, May 26 2015

Select[Prime@ Range@ 1000, Mod[#, 8] == Mod[#, 27] &] (* Michael De Vlieger, Apr 27 2015 *)

is(n)=my(k=n%216); (k==1||k==5||k==7) && isprime(n) \\ Charles R Greathouse IV, May 26 2015

a(n) = A000040(A257482(n)).

a(n) ~ 24n log n. - Charles R Greathouse IV, May 26 2015

cp's OEIS Frontend

A039710 a(n) = n-th prime modulo 12.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A039711 a(n) = n-th prime modulo 13.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A039712 a(n) = n-th prime modulo 14.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A039713 a(n) = n-th prime modulo 15.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A039714 a(n) = n-th prime modulo 16.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A257482 Numbers m such that prime(m) mod 8 == prime(m) mod 27.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A257483 Primes p such that (p mod 8) = (p mod 27).

Views

Author