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.

A064767 Order of automorphism group of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).

Original entry on oeis.org

1, 168, 11232, 86016, 1488000, 1886976, 33784128, 44040192, 221079456, 249984000, 2124276000, 966131712, 9726417792, 5675733504, 16713216000, 22548578304, 111203278848, 37141348608, 304812862560, 127991808000
Offset: 1

Views

Author

Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Oct 24 2001

Keywords

Comments

Also number of 3 X 3 invertible matrices over the ring Z/nZ. - Max Alekseyev, Nov 02 2007
Order of the group GL(3,Z_n). For n > 2, a(n) is divisible by 96. - Jianing Song, Nov 24 2018

Crossrefs

Row n=3 of A316622.
Cf. A000252 (GL(2,Z_n)), A305186 (GL(4,Z_n)).
Cf. A000056 (SL(2,Z_n)), A011785 (SL(3,Z_n)), A011786 (SL(4,Z_n)).

Programs

  • Mathematica
    a[n_] := n^9*Times @@ Function[p, (1 - 1/p^3)*(1 - 1/p^2)*(1 - 1/p)] /@ FactorInteger[n][[All, 1]]; a[1] = 1; Array[a, 20] (* Jean-François Alcover, Mar 21 2017 *)
  • PARI
    a(n) = n^9*prod(k=2, n, if (!isprime(k) || (n % k), 1, (1-1/k^3)*(1-1/k^2)*(1-1/k))); \\ Michel Marcus, Jun 30 2015
    
  • PARI
    a(n,f=factor(n))=prod(i=1,#f~, ((1 - 1/f[i,1]^3)*(1 - 1/f[i,1]^2)*(1 - 1/f[i,1])))*n^9 \\ Charles R Greathouse IV, Mar 04 2025
    
  • Python
    from math import prod
    from sympy import factorint
    def A064767(n): return prod(p**(3*(3*e-2))*(p*(p*(p**2*(p*(p-1)-1)+1)+1)-1) for p, e in factorint(n).items()) # Chai Wah Wu, Mar 04 2025

Formula

a(n) = phi(n)*A011785(n). - Vladeta Jovovic, Oct 29 2001
a(n) = n^9*Product_{primes p dividing n} ((1 - 1/p^3)*(1 - 1/p^2)*(1 - 1/p)). This also gives a formula for A011785.
Multiplicative with a(p^e) = p^(9*e-6)*(p^3 - 1)*(p^2 - 1)*(p - 1). - Vladeta Jovovic, Nov 18 2001
Sum_{k=1..n} a(k) ~ c * n^10, where c = (1/10) * Product_{p prime} ((p^7 - p^5 - p^4 + p^2 + p - 1)/p^7) = 0.05123382571... . - Amiram Eldar, Oct 23 2022

Extensions

More terms from Vladeta Jovovic, Nov 18 2001

A064969 Number of cyclic subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).

Original entry on oeis.org

1, 8, 14, 36, 32, 112, 58, 148, 131, 256, 134, 504, 184, 464, 448, 596, 308, 1048, 382, 1152, 812, 1072, 554, 2072, 807, 1472, 1184, 2088, 872, 3584, 994, 2388, 1876, 2464, 1856, 4716, 1408, 3056, 2576, 4736, 1724, 6496, 1894, 4824, 4192, 4432, 2258, 8344
Offset: 1

Views

Author

Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Oct 30 2001

Keywords

Comments

Inverse Moebius transform of A160889. - Vladeta Jovovic, Nov 21 2009

Crossrefs

Programs

  • Maple
    with(numtheory):
    # define Jordan totient function J(r,n)
    J(r,n) := add(d^r*mobius(n/d), d in divisors(n)):
    seq(add(J(3,d)/phi(d), d in divisors(n)), n = 1..50); # Peter Bala, Jan 23 2024
  • Mathematica
    a[n_] := Sum[EulerPhi[i] EulerPhi[j] (EulerPhi[k] / EulerPhi[LCM[i, j, k]]), {i, Divisors[n]}, {j, Divisors[n]}, {k, Divisors[n]}];
    Array[a, 48] (* Jean-François Alcover, Dec 13 2018, after Vladeta Jovovic *)
    f[p_, e_] := 1 + (p^2 + p + 1)*((p^(2*e) - 1)/(p^2 - 1)); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 15 2022 *)
  • PARI
    a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, eulerphi(i)*eulerphi(j)*eulerphi(k)/eulerphi(lcm(lcm(i, j), k))))); \\ Michel Marcus, Dec 14 2018
    
  • PARI
    a160889(n) = sumdiv(n, d, moebius(n/d)*d^3)/eulerphi(n);
    a(n) = sumdiv(n, d, a160889(d)); \\ Seiichi Manyama, May 12 2021

Formula

a(n) = Sum_{i|n, j|n, k|n} phi(i)*phi(j)*phi(k)/phi(lcm(i, j, k)), where phi is Euler totient function (cf. A000010).
From Amiram Eldar, Nov 15 2022: (Start)
Multiplicative with a(p^e) = 1 + (p^2 + p + 1)*((p^(2*e) - 1)/(p^2 - 1)).
Sum_{k=1..n} a(k) ~ c * n^3, where c = (zeta(3)/3) * Product_{p prime} (1 + 1/p^2 + 1/p^3) = A002117 * A330595 / 3 = 0.700772... . (End)
a(n) = Sum_{d divides n} J_3(d)/phi(d) = Sum_{1 <= i, j, k <= n} 1/phi(n/gcd(i,j,k,n)), where the Jordan totient function J_3(n) = A059376(n). - Peter Bala, Jan 23 2024

Extensions

Formula and more terms from Vladeta Jovovic, Oct 30 2001

A280162 Number of subgroups of the group C_n x C_n x C_n x C_n, where C_n is the cyclic group of order n.

Original entry on oeis.org

1, 67, 212, 1983, 1120, 14204, 3652, 43339, 24033, 75040, 19156, 420396, 35872, 244684, 237440, 821335, 99472, 1610211, 152404, 2220960, 774224, 1283452, 318532, 9187868, 810969, 2403424, 2222704, 7241916, 783904, 15908480, 1016836, 14445411, 4061072, 6664624, 4090240, 47657439, 2031712
Offset: 1

Views

Author

Laszlo Toth, Dec 27 2016

Keywords

Crossrefs

Programs

  • PARI
    \\ For numsubgrp, see the Alekseyev link.
    a(n)=my(f=factor(n)); prod(i=1,#f~, numsubgrp(f[i,1],f[i,2]*[1,1,1,1])) \\ Charles R Greathouse IV, Dec 27 2016

Extensions

Terms a(32) and beyond from Charles R Greathouse IV, Dec 27 2016
Showing 1-3 of 3 results.