cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A382414 Primes p such that gcd(ord_p(2), ord_p(5)) = 1.

Original entry on oeis.org

31, 601, 2593, 599479, 204700049, 466344409, 668731841, 11638603429
Offset: 1

Views

Author

Li GAN, Apr 26 2025

Keywords

Comments

'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.
1790799748670521, 58523123221688392679 and 14551915228363037109375001 are also terms. - Giorgos Kalogeropoulos, May 03 2025

Links

Crossrefs

Cf. A014664, A211241, A344202, A383411.

Programs

  • Mathematica
    Select[Range[10000], PrimeQ[#] && CoprimeQ[MultiplicativeOrder[2, #], MultiplicativeOrder[5, #]] &]
  • PARI
    forprime(p=13, oo, if(1==gcd(znorder(Mod(5, p)), znorder(Mod(2, p))), print1(p, ", "))); \\ Joerg Arndt, Apr 26 2025

A383467 Primes p such that gcd(ord_p(2), ord_p(6)) = 1.

Original entry on oeis.org

5, 7, 31, 43, 135607, 153649, 270841, 1489441, 1505447, 25781083, 127236649, 558062249, 745988807, 27989941729, 29512739491, 47206579351
Offset: 1

Views

Author

Li GAN, Apr 27 2025

Keywords

Comments

'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.

Links

Crossrefs

Cf. A014664, A211242, A344202, A383411, A382414.

Programs

  • Mathematica
    Select[Range[10000], PrimeQ[#] && CoprimeQ[MultiplicativeOrder[2, #], MultiplicativeOrder[6, #]] &]
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.