A059888 -id:A059888 - cp's OEIS frontend

A059891 a(n) = |{m : multiplicative order of 9 mod m = n}|.

4, 6, 12, 14, 20, 58, 12, 88, 112, 150, 60, 290, 12, 138, 732, 144, 124, 1088, 60, 670, 740, 570, 28, 13864, 360, 138, 3968, 1362, 252, 22058, 124, 320, 1972, 1146, 732, 10704, 124, 570, 12260, 15176, 124, 60470, 28, 11634, 195728, 282, 508, 116592, 2032

Offset: 1

Vladeta Jovovic, Feb 06 2001

nonn

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).
Also, number of primitive factors of 9^n - 1. - Max Alekseyev, May 03 2022

Max Alekseyev, Table of n, a(n) for n = 1..690

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, A274909.
Column k=9 of A212957.

with(numtheory):
a:= n-> add(mobius(n/d)*tau(9^d-1), d=divisors(n)):
seq(a(n), n=1..40);  # Alois P. Heinz, Oct 12 2012

a[n_] := Sum[MoebiusMu[n/d]*DivisorSigma[0, 9^d-1], {d, Divisors[n]}];
Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Jan 13 2025, after Alois P. Heinz *)

a(n) = sumdiv(n, d, moebius(n/d) * numdiv(9^d-1)); \\ Amiram Eldar, Jan 25 2025

a(n) = Sum_{d|n} mu(n/d)*tau(9^d-1), (mu(n) = Moebius function A008683, tau(n) = number of divisors of n A000005).

A085031 Number of prime factors of cyclotomic(n,6), which is A019324(n), the value of the n-th cyclotomic polynomial evaluated at x=6.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 2, 4, 1, 2, 2, 1, 1, 4, 1, 3, 3, 2, 2, 1, 1, 2, 3, 2, 2, 3, 3, 5, 2, 2, 2, 2, 1, 4, 3, 3, 2, 3, 2, 3, 1, 3, 3, 3, 2, 2, 4, 3, 3, 3, 4, 3, 1, 4, 3, 4, 3, 2, 2, 2, 5, 1, 3, 4, 3, 3, 2, 2, 4, 3, 3, 2, 3, 7, 2, 3, 1, 4, 2, 3, 1, 2

Offset: 1

T. D. Noe, Jun 19 2003

nonn

The Mobius transform of this sequence yields A057955, number of prime factors of 6^n-1.

See references at A085021

Max Alekseyev, Table of n, a(n) for n = 1..430

omega(Phi(n,x)): A085021 (x=2), A085028 (x=3), A085029 (x=4), A085030 (x=5), this sequence (x=6), A085032 (x=7), A085033 (x=8), A085034 (x=9), A085035 (x=10).

Cf. A019324, A057955, A059888, A274907.

Table[Plus@@Transpose[FactorInteger[Cyclotomic[n, 6]]][[2]], {n, 1, 100}]

A366620 Number of distinct prime divisors of 6^n - 1.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 4, 5, 3, 7, 3, 5, 5, 6, 5, 7, 3, 8, 4, 5, 5, 9, 4, 7, 6, 8, 2, 10, 3, 9, 6, 8, 6, 13, 6, 6, 6, 11, 3, 9, 5, 9, 10, 8, 4, 13, 5, 8, 9, 11, 4, 11, 6, 13, 7, 6, 4, 19, 4, 5, 10, 12, 8, 12, 3, 11, 8, 16, 2, 18, 5, 10, 10, 9, 6, 15, 4, 16, 8

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..430

Cf. A024062, A001221, A057955, A059888, A274907, A366621, A366622, A366623.

Cf. A046800, A133801, A366604, A366611, A366632, A366651, A366660, A102347, A366681, A366707.

for(n = 1, 100, print1(omega(6^n - 1), ", "))

a(n) = omega(6^n-1) = A001221(A024062(n)).

A274907 Largest prime factor of 6^n - 1.

Original entry on oeis.org

5, 7, 43, 37, 311, 43, 55987, 1297, 2467, 311, 3154757, 97, 760891, 55987, 1201, 98801, 30839, 46441, 638073026189, 6781, 1822428931, 51828151, 7505944891, 1678321, 40185601, 760891, 623067280651, 5030761, 7369130657357778596659, 1950271, 49744740983476472807

Offset: 1

Vincenzo Librandi, Jul 11 2016

nonn

			6^5 - 1 = 7775 = 5*5*311, so a(5) = 311.

Max Alekseyev, Table of n, a(n) for n = 1..430 (terms 1..100 from Vincenzo Librandi, term 101..420 from Amiram Eldar)
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

Cf. A006530, A057955, A059888, A085031, A024062, A366620, A366621, A366622, A366623.

Cf. similar sequences listed in A274906.

[Maximum(PrimeDivisors(6^n-1)): n in [1..40]];

Table[FactorInteger[6^n - 1][[-1, 1]], {n, 40}]

a(n) = vecmax(factor(6^n-1)[,1]); \\ Michel Marcus, Jul 13 2016

a(n) = A006530(A024062(n)). - Michel Marcus, Jul 11 2016

cp's OEIS Frontend

A059891 a(n) = |{m : multiplicative order of 9 mod m = n}|.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A085031 Number of prime factors of cyclotomic(n,6), which is A019324(n), the value of the n-th cyclotomic polynomial evaluated at x=6.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

A366620 Number of distinct prime divisors of 6^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A274907 Largest prime factor of 6^n - 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula