A244739 -id:A244739 - cp's OEIS frontend

A024707 Positions of multiples of 5 in A024702.

5, 8, 10, 11, 13, 17, 18, 20, 22, 24, 26, 29, 32, 34, 35, 36, 41, 42, 43, 46, 47, 50, 52, 53, 54, 57, 58, 60, 64, 67, 70, 72, 75, 77, 79, 80, 81, 82, 83, 85, 87, 89, 92, 94, 95, 97, 98, 100, 104, 105, 109, 110, 114, 115, 116, 120, 121, 125, 126, 127, 128, 131, 133, 135, 136, 140, 141

Offset: 1

Clark Kimberling

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A244738, A244739, A244741.

A024707:=n->`if`((ithprime(n) mod 5) mod 3 = 1, n, NULL): seq(A024707(n), n=1..150); # Wesley Ivan Hurt, Jul 06 2014

z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
v1 = Flatten[Position[u, 0]]  (* A244739 *)
v2 = Flatten[Position[u, 1]]  (* A024707 *)
v3 = Flatten[Position[u, 2]]  (* A244741 *) (* Clark Kimberling , Jul 05 2014 *)

apply(n->primepi(n), select(n->n%9==1||n%9==8, primes(100))) \\ Charles R Greathouse IV, May 31 2013

Numbers n such that ((prime(n) mod 5) mod 3) = 1; e.g., prime(10) = 29, (29 mod 5) = 4, and (4 mod 3) = 1. Clark Kimberling, Jul 05 2014

A244738 a(n) = (prime(n) mod 5) mod 3.

Original entry on oeis.org

2, 0, 0, 2, 1, 0, 2, 1, 0, 1, 1, 2, 1, 0, 2, 0, 1, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 2, 1, 0, 2, 1, 2, 1, 1, 1, 2, 0, 2, 0, 1, 1, 1, 0, 2, 1, 1, 0, 2, 1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 0, 0, 2, 1, 0, 2, 1, 2, 2, 1, 0, 1, 2, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 0

Offset: 1

Clark Kimberling, Jul 05 2014

			n ... prime(n) mod 5 mod 3
1 ..... 2 ..... 2 ... 2
2 ..... 3 ..... 3 ... 0
3 ..... 5 ..... 0 ... 0
4 ..... 7 ..... 2 ... 2
5 ..... 11 .... 1 ... 1
6 ..... 13 .... 3 ... 0

Clark Kimberling, Table of n, a(n) for n = 1..4000

Cf. A039703, A244739, A024707, A244741, A244735.

z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
v1 = Flatten[Position[u, 0]]  (* A244739 *)
v2 = Flatten[Position[u, 1]]  (* A024707 *)
v3 = Flatten[Position[u, 2]]  (* A244741 *)
Mod[Mod[Prime[Range[90]],5],3] (* Harvey P. Dale, Aug 14 2019 *)

A244741 Numbers k such that (prime(k) mod 5) == 2 (mod 3).

Original entry on oeis.org

1, 4, 7, 12, 15, 19, 25, 28, 31, 33, 37, 39, 45, 49, 55, 59, 63, 66, 68, 69, 73, 78, 88, 91, 93, 101, 102, 106, 107, 111, 113, 118, 123, 129, 134, 138, 139, 144, 148, 151, 154, 155, 159, 161, 163, 165, 168, 181, 184, 187, 195, 199, 203, 206, 211, 214, 217

Offset: 1

Clark Kimberling, Jul 05 2014

Every positive integer is in exactly one of the sequences A244739, A024707, A244741.

			n ... prime(n) mod 5 mod 3
1 ..... 2 ..... 2 ... 2
2 ..... 3 ..... 3 ... 0
3 ..... 5 ..... 0 ... 0
4 ..... 7 ..... 2 ... 2
5 ..... 11 .... 1 ... 1
6 ..... 13 .... 3 ... 0

Clark Kimberling, Table of n, a(n) for n = 1..1000

Cf. A039703, A244738, A244739, A024707, A244735. Essentially the same as A049509.

A244741:=n->`if`(((ithprime(n) mod 5) mod 3) = 2, n, NULL): seq(A244741(n), n=1..250); # Wesley Ivan Hurt, Jul 06 2014

z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
v1 = Flatten[Position[u, 0]]  (* A244739 *)
v2 = Flatten[Position[u, 1]]  (* A024707 *)
v3 = Flatten[Position[u, 2]]  (* A244741 *)

cp's OEIS Frontend

A024707 Positions of multiples of 5 in A024702.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A244738 a(n) = (prime(n) mod 5) mod 3.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A244741 Numbers k such that (prime(k) mod 5) == 2 (mod 3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica