LINKS
Max Alekseyev, <a href="/A059891/b059891_2.txt">Table of n, a(n) for n = 1..690</a>
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A059891
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
editing
approved
LINKS
Max Alekseyev, <a href="/A059891/b059891_2.txt">Table of n, a(n) for n = 1..682690</a>
STATUS
approved
editing
LINKS
Max Alekseyev, <a href="/A059891/b059891_1.txt">Table of n, a(n) for n = 1..682</a>
STATUS
editing
approved
LINKS
Max Alekseyev, <a href="/A059891/b059891_1.txt">Table of n, a(n) for n = 1..676682</a>
STATUS
approved
editing
STATUS
editing
approved
COMMENTS
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(9).
a(n) = number of orders of degree-n monic irreducible polynomials over GF(9).
Also, number of primitive factors of 9^n - 1. - Max Alekseyev, May 03 2022
CROSSREFS
Number of primitive factors of b^n - 1: A059499 (b=2), A059885(b=3), A059886 (b=4), A059887 (b=5), A059888 (b=6), A059889 (b=7), A059890 (b=8), this sequence (b=9), A059892 (b=10).
Cf. A000005, A008683, A027381, A053452, A057952, A058946, A059499, A059885-A059890, A059892A274909.
Column k=9 of A212957. - _Alois P. Heinz_, Oct 12 2012
LINKS
Max Alekseyev, <a href="/A059891/b059891.txt">Table of n, a(n) for n = 1..676</a>
KEYWORD
easy,nonn
nonn
STATUS
approved
editing
STATUS
editing
approved