LINKS
Max Alekseyev, <a href="/A059889/b059889_1.txt">Table of n, a(n) for n = 1..388</a>
The OEIS is supported by the many generous donors to the OEIS Foundation.
Max Alekseyev, <a href="/A059889/b059889_1.txt">Table of n, a(n) for n = 1..388</a>
editing
approved
Max Alekseyev, <a href="/A059889/b059889_1.txt">Table of n, a(n) for n = 1..382388</a>
approved
editing
editing
approved
The multiplicative order of a mod m, gcd(a,m)=1, is the smallest natural number d for which a^d = 1 (mod m). a(n) = number of orders of degree n monic irreducible polynomials over GF(7).
a(n) = number of orders of degree n monic irreducible polynomials over GF(7).
Also, number of primitive factors of 7^n - 1 (cf. A218358). - Max Alekseyev, May 03 2022
Number of primitive factors of b^n - 1: A059499 (b=2), A059885(b=3), A059886 (b=4), A059887 (b=5), A059888 (b=6), this sequence (b=7), A059890 (b=8), A059891 (b=9), A059892 (b=10).
Cf. A000005, A008683, A058946, A053450, A057954, A058946, A059499, A059885-A059888, A059890-A059892, A074249, A212486., A218358
Column k=7 of A212957. - _Alois P. Heinz_, Oct 12 2012
Max Alekseyev, <a href="/A059889/b059889.txt">Table of n, a(n) for n = 1..382</a>
easy,nonn
nonn
approved
editing
editing
approved
with (numtheory):
seq (a(n), n=1..40); # Alois P. Heinz, Oct 12 2012
approved
editing
_Vladeta Jovovic (vladeta(AT)eunet.rs), _, Feb 06 2001
editing
approved