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 A382414 #56 May 03 2025 14:22:49 %S A382414 31,601,2593,599479,204700049,466344409,668731841,11638603429 %N A382414 Primes p such that gcd(ord_p(2), ord_p(5)) = 1. %C A382414 '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. %C A382414 1790799748670521, 58523123221688392679 and 14551915228363037109375001 are also terms. - _Giorgos Kalogeropoulos_, May 03 2025 %H A382414 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 A382414 Select[Range[10000], PrimeQ[#] && CoprimeQ[MultiplicativeOrder[2, #], MultiplicativeOrder[5, #]] &] %o A382414 (PARI) forprime(p=13, oo, if(1==gcd(znorder(Mod(5, p)), znorder(Mod(2, p))), print1(p, ", "))); \\ _Joerg Arndt_, Apr 26 2025 %Y A382414 Cf. A014664, A211241, A344202, A383411. %K A382414 nonn,hard,more %O A382414 1,1 %A A382414 _Li GAN_, Apr 26 2025