login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160960 a(n) = Sum_{d|n} Moebius(n/d)*d^(b-1)/phi(n) for b = 12. 4

%I #28 Nov 08 2022 08:07:45

%S 1,2047,88573,2096128,12207031,181308931,329554457,2146435072,

%T 5230147077,24987792457,28531167061,185660345344,149346699503,

%U 674597973479,1081213356763,2197949513728,2141993519227,10706111066619

%N a(n) = Sum_{d|n} Moebius(n/d)*d^(b-1)/phi(n) for b = 12.

%C a(n) is the number of lattices L in Z^11 such that the quotient group Z^11 / L is C_n. - _Álvar Ibeas_, Nov 26 2015

%H Álvar Ibeas, <a href="/A160960/b160960.txt">Table of n, a(n) for n = 1..10000</a>

%H Jin Ho Kwak and Jaeun Lee, <a href="https://doi.org/10.1142/9789812799890_0005">Enumeration of graph coverings, surface branched coverings and related group theory</a>, in Combinatorial and Computational Mathematics (Pohang, 2000), ed. S. Hong et al., World Scientific, Singapore 2001, pp. 97-161. See p. 134.

%H <a href="/index/J#nome">Index to Jordan function ratios J_k/J_1</a>.

%F a(n) = J_11(n)/J_1(n) where J_11 and J_1(n) = A000010(n) are Jordan functions. - _R. J. Mathar_, Jul 12 2011

%F From _Álvar Ibeas_, Nov 26 2015: (Start)

%F Multiplicative with a(p^e) = p^(10e-10) * (p^11-1) / (p-1).

%F For squarefree n, a(n) = A000203(n^10). (End)

%F From _Amiram Eldar_, Nov 08 2022: (Start)

%F Sum_{k=1..n} a(k) ~ c * n^11, where c = (1/11) * Product_{p prime} (1 + (p^10-1)/((p-1)*p^11)) = 0.1766326404... .

%F Sum_{k>=1} 1/a(k) = zeta(10)*zeta(11) * Product_{p prime} (1 - 2/p^11 + 1/p^21) = 1.0005003781952... . (End)

%t b = 12; Table[Sum[MoebiusMu[n/d] d^(b - 1)/EulerPhi@ n, {d, Divisors@ n}], {n, 18}] (* _Michael De Vlieger_, Nov 27 2015 *)

%t f[p_, e_] := p^(10*e - 10) * (p^11-1) / (p-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 25] (* _Amiram Eldar_, Nov 08 2022 *)

%o (PARI) vector(100, n, sumdiv(n^10, d, if(ispower(d, 11), moebius(sqrtnint(d, 11))*sigma(n^10/d), 0))) \\ _Altug Alkan_, Nov 26 2015

%o (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i,1]^11 - 1)*f[i,1]^(10*f[i,2] - 10)/(f[i,1] - 1));} \\ _Amiram Eldar_, Nov 08 2022

%Y Column 11 of A263950.

%Y Cf. A000010, A000203, A013668, A013669.

%K nonn,mult

%O 1,2

%A _N. J. A. Sloane_, Nov 19 2009

%E Definition corrected by _Enrique Pérez Herrero_, Oct 30 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)