cp's OEIS Frontend

A093600 Numerator of Sum_{1<=k<=n, gcd(k,n)=1} 1/k.

%I A093600 #30 Feb 16 2025 08:32:53
%S A093600 1,1,3,4,25,6,49,176,621,100,7381,552,86021,11662,18075,91072,2436559,
%T A093600 133542,14274301,5431600,9484587,2764366,19093197,61931424,399698125,
%U A093600 281538452,8770427199,1513702904,315404588903,323507400,9304682830147
%N A093600 Numerator of Sum_{1<=k<=n, gcd(k,n)=1} 1/k.
%C A093600 The divisibility properties of this sequence are given by Leudesdorf's theorem.
%C A093600 Problem: are there numbers n > 1 such that n^4 | a(n)? Let b(n) be the numerator of Sum_{1<=k<=n, gcd(k,n)=1} 1/k^2. Conjecture: if, for some e > 0, n^e | a(n), then n^(e-1) | b(n). It appears that, for any odd number n, n^e | a(n) if and only if n^(e-1) | b(n). - _Thomas Ordowski_, Aug 12 2019
%D A093600 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 4th ed., Oxford Univ. Press, 1971, page 100. [3rd. ed., Theorem 128, page 101]
%H A093600 Seiichi Manyama, <a href="/A093600/b093600.txt">Table of n, a(n) for n = 1..2310</a>
%H A093600 Emre Alkan, <a href="http://www.jstor.org/stable/2975168">Variations on Wolstenholme's Theorem</a>, Amer. Math. Monthly, Vol. 101, No. 10 (Dec. 1994), 1001-1004.
%H A093600 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LeudesdorfTheorem.html">Leudesdorf Theorem</a>
%F A093600 G.f. A(x) (for fractions) satisfies: A(x) = -log(1 - x)/(1 - x) - Sum_{k>=2} A(x^k)/k. - _Ilya Gutkovskiy_, Mar 31 2020
%t A093600 Table[s=0; Do[If[GCD[i, n]==1, s=s+1/i], {i, n}]; Numerator[s], {n, 1, 35}]
%o A093600 (PARI) for (n=1, 40, print1(numerator(sum(k=1, n, if (gcd(k, n)==1, 1/k))), ", ")) \\ _Seiichi Manyama_, Aug 11 2017
%o A093600 (Magma) [Numerator(&+[1/k:k in [1..n]|Gcd(k,n) eq 1]):n in [1..31]]; // _Marius A. Burtea_, Aug 14 2019
%Y A093600 Cf. A069220 (denominator of this sum), A001008 (numerator of the n-th harmonic number).
%K A093600 nonn,frac
%O A093600 1,3
%A A093600 _T. D. Noe_, Apr 03 2004