A191609 Primes modulo which the multiplicative orders of 2 and 3 are equal.

5, 19, 23, 29, 47, 53, 71, 97, 101, 139, 149, 163, 167, 173, 191, 197, 211, 239, 263, 269, 293, 311, 317, 359, 379, 383, 389, 409, 431, 461, 479, 499, 503, 509, 557, 599, 643, 647, 653, 677, 701, 719, 743, 773, 797, 821, 839, 859, 863, 887, 907, 941, 983

Offset

1,1

Links

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

Maple

select(p -> isprime(p) and numtheory:-order(2, p) = numtheory:-order(3, p), [seq(i, i=5..10000, 2)]); # Robert Israel, Jan 24 2024

Mathematica

okQ[p_] := MultiplicativeOrder[2, p] == MultiplicativeOrder[3, p];
Select[Prime[Range[1000]], okQ] (* Jean-François Alcover, Nov 23 2024 *)

Prog

(PARI) forprime(p=5, 10^3, if( znorder(Mod(2, p))==znorder(Mod(3, p)), print1(p, ", "); ) )

Crossrefs

Cf. A123988, A127437, A127438.

Sequence in context: A152912 A191054 A097934 * A191084 A146509 A062340

Adjacent sequences: A191606 A191607 A191608 * A191610 A191611 A191612

Keyword

nonn,easy

Author

Max Alekseyev, Jun 08 2011

Status

approved