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.

A003572 Order of 3 mod 3n+2.

Original entry on oeis.org

1, 4, 2, 5, 6, 16, 4, 11, 3, 28, 8, 12, 18, 8, 10, 23, 20, 52, 6, 29, 30, 12, 16, 35, 18, 30, 4, 41, 42, 88, 22, 36, 42, 100, 6, 53, 20, 112, 28, 48, 10, 100, 32, 65, 22, 136, 12, 15, 12, 148, 18, 60, 78, 66, 8, 83, 16, 172
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • GAP
    List([0..60],n->OrderMod(3,3*n+2)); # Muniru A Asiru, Feb 16 2019
  • Maple
    with(numtheory): f := n->order(3,3*n+2);
  • Mathematica
    Table[MultiplicativeOrder[3, 3*n + 2], {n, 0, 57}] (* Jinyuan Wang, Feb 16 2019 *)
  • PARI
    a(n) = znorder(Mod(3, 3*n+2)); \\ Michel Marcus, Feb 16 2019
    

A003574 Order of 4 mod 4n-1.

Original entry on oeis.org

1, 3, 5, 2, 9, 11, 9, 5, 6, 6, 7, 23, 4, 10, 29, 3, 33, 35, 10, 39, 41, 14, 6, 18, 15, 51, 53, 18, 22, 12, 10, 7, 65, 18, 69, 30, 21, 15, 10, 26, 81, 83, 9, 30, 89, 30, 20, 95, 6, 99, 42, 33, 105, 14, 9, 37, 113, 15, 46, 119
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A003573. Second bisection of A053447.

Programs

  • GAP
    List([1..70],n->OrderMod(4,4*n-1)); # Muniru A Asiru, Feb 19 2019
    
  • Maple
    with(numtheory): f := n->order(4,4*n-1);
  • PARI
    a(n) = znorder(Mod(4, 4*n-1)); \\ Michel Marcus, Feb 22 2019

Formula

a(n) = A053447(2*n-1) for n >= 1. - Jianing Song, Oct 03 2022
Showing 1-2 of 2 results.