|
|
A060724
|
|
Number of subgroups of the group C_n X C_n (where C_n is the cyclic group of order n).
|
|
17
|
|
|
1, 5, 6, 15, 8, 30, 10, 37, 23, 40, 14, 90, 16, 50, 48, 83, 20, 115, 22, 120, 60, 70, 26, 222, 45, 80, 76, 150, 32, 240, 34, 177, 84, 100, 80, 345, 40, 110, 96, 296, 44, 300, 46, 210, 184, 130, 50, 498, 75, 225, 120, 240, 56, 380, 112, 370, 132, 160, 62, 720, 64
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) is multiplicative: if the canonical factorization of n is the product of p^e(p) over primes then a(n) = product a(p^e(p)). For a prime p: a(p) = p + 3.
a(p^e) = (p^(e+2)+p^(e+1)+1+2*e-3*p-2*e*p)/(p-1)^2.
Also a(n) = Sum_{d|n} phi(n/d)*tau(d)^2.
Dirichlet g.f. zeta^3(s)*zeta(s-1)/zeta(2*s). - R. J. Mathar, Mar 14 2011
|
|
EXAMPLE
|
a(2) = 5 because for the group C_2 X C_2 there are the following subgroups: the trivial subgroup, the whole group and the three subgroups of order 2.
|
|
MAPLE
|
for n from 1 to 200 do: ans := 1: for i from 1 to nops(ifactors(n)[2]) do p := ifactors(n)[2][i][1]: e := ifactors(n)[2][i][2]: ans := ans*(p^(e+2)+p^(e+1)+1+2*e-3*p-2*e*p)/(p-1)^2: od: printf(`%d, `, ans): od:
|
|
MATHEMATICA
|
ppCase[ {p_Integer, e_Integer} ] := (1-2*e*(p-1)+p*(p^e*(1+p)-3))/(p-1)^2; Table[ Times @@ (ppCase /@ FactorInteger[ i ]), {i, 1, 100} ]
|
|
PROG
|
(GAP) List([1..50], n->Sum(ConjugacyClassesSubgroups( LatticeSubgroups( DirectProduct( List([n, n], k->CyclicGroup(k)) ))), Size)); # Andrew Howroyd, Jul 01 2018
(PARI) a(n)={sumdiv(n, d, eulerphi(n/d)*numdiv(d)^2)} \\ Andrew Howroyd, Jul 01 2018
(PARI) a(n) = sum(k=1, n, numdiv(gcd(k, n))^2); \\ Seiichi Manyama, May 11 2021
(Sage)
d = divisors(n); cp = cartesian_product([d, d])
return reduce(lambda x, y: x+y, map(gcd, cp))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Avi Peretz (njk(AT)netvision.net.il), Apr 21 2001
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|