This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A191609 #15 Nov 23 2024 11:14:16 %S A191609 5,19,23,29,47,53,71,97,101,139,149,163,167,173,191,197,211,239,263, %T A191609 269,293,311,317,359,379,383,389,409,431,461,479,499,503,509,557,599, %U A191609 643,647,653,677,701,719,743,773,797,821,839,859,863,887,907,941,983 %N A191609 Primes modulo which the multiplicative orders of 2 and 3 are equal. %H A191609 Robert Israel, <a href="/A191609/b191609.txt">Table of n, a(n) for n = 1..10000</a> %p A191609 select(p -> isprime(p) and numtheory:-order(2,p) = numtheory:-order(3,p), [seq(i,i=5..10000,2)]); # _Robert Israel_, Jan 24 2024 %t A191609 okQ[p_] := MultiplicativeOrder[2, p] == MultiplicativeOrder[3, p]; %t A191609 Select[Prime[Range[1000]], okQ] (* _Jean-François Alcover_, Nov 23 2024 *) %o A191609 (PARI) forprime(p=5,10^3, if( znorder(Mod(2,p))==znorder(Mod(3,p)), print1(p,", ");) ) %Y A191609 Cf. A123988, A127437, A127438. %K A191609 nonn,easy %O A191609 1,1 %A A191609 _Max Alekseyev_, Jun 08 2011