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-3 of 3 results.

A003573 Order of 4 mod 4n+1.

Original entry on oeis.org

1, 2, 3, 6, 4, 3, 10, 14, 5, 18, 10, 6, 21, 26, 9, 30, 6, 11, 9, 15, 27, 4, 11, 5, 24, 50, 6, 18, 14, 6, 55, 50, 7, 9, 34, 23, 14, 74, 12, 26, 33, 10, 78, 86, 29, 90, 18, 9, 48, 98, 33, 10, 45, 35, 15, 12, 30, 38, 29, 39, 12, 42, 41, 55, 8, 42, 26, 134, 6, 46, 35
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A003574. First bisection of A053447.

Programs

  • GAP
    List([0..70],n->OrderMod(4,4*n+1)); # Muniru A Asiru, Feb 16 2019
    
  • Maple
    a := n -> `if`(n=0, 1, numtheory:-order(4, 4*n+1)): seq(a(n), n = 0..68);
  • Mathematica
    Table[MultiplicativeOrder[4, 4*n + 1], {n, 0, 70}] (* Arkadiusz Wesolowski, Nov 27 2012 *)
  • PARI
    a(n) = znorder(Mod(4, 4*n+1)); \\ Michel Marcus, Feb 16 2019
  • Sage
    def A003573(n):
        s, m, N = 0, 1, 4*n + 1
        while True:
            k = N + m
            v = valuation(k, 4)
            s += v
            m = k // 4^v
            if m == 1: break
        return s
    print([A003573(n) for n in (0..70)]) # Peter Luschny, Oct 07 2017
    

Formula

a(n) = A053447(2*n) for n >= 0. - Jianing Song, Oct 03 2022

Extensions

a(0) = 1 added by Peter Luschny, Oct 07 2017

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
    

A217852 Multiplicative order of 5 (mod 5*n - 1).

Original entry on oeis.org

1, 6, 6, 9, 2, 14, 16, 4, 5, 42, 18, 29, 16, 22, 36, 39, 6, 44, 46, 30, 4, 27, 18, 48, 3, 42, 22, 69, 12, 37, 30, 52, 20, 52, 14, 89, 22, 18, 96, 33, 16, 45, 106, 72, 24, 114, 12, 119, 30, 82, 42, 36, 10, 67, 136, 6, 5, 272, 42, 44, 36, 102, 156, 70, 54, 138, 166
Offset: 1

Views

Author

Arkadiusz Wesolowski, Nov 16 2012

Keywords

Comments

Least m such that 5*n - 1 divides 5^m - 1.

Crossrefs

Programs

  • GAP
    List([1..70],n->OrderMod(5,5*n-1)); # Muniru A Asiru, Feb 25 2019
  • Mathematica
    Table[MultiplicativeOrder[5, 5*n - 1], {n, 67}]
  • PARI
    vector(80, n, znorder(Mod(5, 5*n-1))) \\ Michel Marcus, Feb 09 2015
    
Showing 1-3 of 3 results.