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 A383411 #32 May 17 2025 22:49:18 %S A383411 2,13,313,51169,797161,3482851,5096867,12207031,162410641,368385827, %T A383411 1001523179,4902814883,104849105869,131772143257,572027881891 %N A383411 Primes p such that gcd(ord_p(3), ord_p(5)) = 1. %C A383411 'ord_p' here means the multiplicative order modulo p, not to be confused with the p-adic order that is also often denoted by ord_p. %H A383411 Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/4190108/for-all-alpha-beta-in-mathbbn-are-there-only-finitely-many-primes-so-that">For all alpha,beta in N, are there only finitely many primes so that gcd(ordp(alpha),ordp(beta))=1?</a>, 2021. %t A383411 Select[Range[10000], PrimeQ[#] && CoprimeQ[MultiplicativeOrder[3, #], MultiplicativeOrder[5, #]] &] %o A383411 (PARI) forprime(p=13,oo,if(1==gcd(znorder(Mod(5,p)),znorder(Mod(3,p))),print1(p,", "))); \\ _Joerg Arndt_, Apr 26 2025 %Y A383411 Cf. A062117, A211241, A344202. %K A383411 nonn,hard,more %O A383411 1,1 %A A383411 _Li GAN_, Apr 26 2025 %E A383411 a(13)-a(15) from _Bill McEachen_, May 11 2025