login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A160898
a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 7.
1
127, 8001, 46228, 256032, 496062, 2912364, 2490216, 8193024, 11233404, 31251906, 22498812, 93195648, 51083718, 156883608, 180566568, 262176768, 191591946, 707704452, 331934820, 1000060992, 906438624, 1417425156, 854570808, 2982260736, 1550193750, 3218274234
OFFSET
1,1
LINKS
Jin Ho Kwak and Jaeun Lee, Enumeration of graph coverings, surface branched coverings and related group theory, in Combinatorial and Computational Mathematics (Pohang, 2000), ed. S. Hong et al., World Scientific, Singapore 2001, pp. 97-161. See p. 134.
FORMULA
a(n) = 127*A160895(n). - R. J. Mathar, Mar 15 2016
From Amiram Eldar, Nov 08 2022: (Start)
Sum_{k=1..n} a(k) ~ c * n^6, where c = (127/6) * Product_{p prime} (1 + (p^5-1)/((p-1)*p^6)) = 40.6863089361... .
Sum_{k>=1} 1/a(k) = (zeta(5)*zeta(6)/127) * Product_{p prime} (1 - 2/p^6 + 1/p^11) = 0.008027649545... . (End)
MATHEMATICA
f[p_, e_] := p^(5*e - 5) * (p^6-1) / (p-1); a[1] = 127; a[n_] := 127 * Times @@ f @@@ FactorInteger[n]; Array[a, 25] (* Amiram Eldar, Nov 08 2022 *)
PROG
(PARI) a(n) = {my(f = factor(n)); 127 * prod(i = 1, #f~, (f[i, 1]^6 - 1)*f[i, 1]^(5*f[i, 2] - 5)/(f[i, 1] - 1)); } \\ Amiram Eldar, Nov 08 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 19 2009
STATUS
approved