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-7 of 7 results.

A027611 Denominator of n * n-th harmonic number.

Original entry on oeis.org

1, 1, 2, 3, 12, 10, 20, 35, 280, 252, 2520, 2310, 27720, 25740, 24024, 45045, 720720, 680680, 4084080, 3879876, 739024, 235144, 5173168, 14872858, 356948592, 343219800, 2974571600, 2868336900, 80313433200, 77636318760
Offset: 1

Views

Author

Glen Burch (gburch(AT)erols.com)

Keywords

Comments

This is very similar to A128438, which is a different sequence. They differ at n=6 (and nowhere else?). - N. J. A. Sloane, Nov 21 2008
Denominator of 1/n + 2/(n-1) + 3/(n-2) + ... + (n-1)/2 + n.
Denominator of Sum_{k=1..n} frac(n/k) where frac(x/y) denotes the fractional part of x/y. - Benoit Cloitre, Oct 03 2002
Denominator of Sum_{d=2..n-1, n mod d > 0} n/d. Numerator = A079076. - Reinhard Zumkeller, Dec 21 2002
a(n) is odd iff n is a power of 2. - Benoit Cloitre, Oct 03 2002
Indices where a(n) differs from A128438 are terms of A074791. - Gary Detlefs, Sep 03 2011

Crossrefs

Programs

  • Haskell
    import Data.Ratio ((%), denominator)
    a027611 n = denominator $ sum $ map (n %) [1..n]
    -- Reinhard Zumkeller, Jul 03 2012
    
  • Magma
    [Denominator(n*HarmonicNumber(n)): n in [1..40]]; // Vincenzo Librandi, Feb 19 2014
    
  • Maple
    a := n -> denom(add((n-j)/j, j=1..n));
    seq(a(n), n = 1..30); # Peter Luschny, May 12 2023
  • Mathematica
    a[n_]:=Denominator[n*HarmonicNumber[n]]; Array[a,100] (* Vladimir Joseph Stephan Orlovsky, Feb 16 2011 *)
  • PARI
    a(n) = denominator(n*sum(k=1, n, 1/k)); \\ Michel Marcus, Feb 15 2015
    
  • Python
    from sympy import harmonic
    def A027611(n): return (n*harmonic(n)).q # Chai Wah Wu, Sep 26 2021
    
  • SageMath
    [denominator(n*harmonic_number(n)) for n in (1..40)] # G. C. Greubel, Aug 24 2022

Formula

From Vladeta Jovovic, Sep 02 2002: (Start)
a(n) = denominators of coefficients in expansion of -log(1-x)/(1-x)^2.
a(n) = denominators of (n+1)*(harmonic(n+1) - 1).
a(n) = denominators of (n+1)*(Psi(n+2) + Euler-gamma - 1). (End)
a(n) = numerator(h(n)/h(n-1)) - denominator(h(n)/h(n-1)), n > 1, where h(n) is the n-th harmonic number. - Gary Detlefs, Sep 03 2011
a(n) = A213999(n, n-2) for n > 1. - Reinhard Zumkeller, Jul 03 2012
a(n) = denominators of coefficients of e.g.f. -1 + exp(x)*(1 + Sum_{j >= 0} (-x)^(j+1)/(j * j!)). - G. C. Greubel, Aug 24 2022

Extensions

Entry revised by N. J. A. Sloane following a suggestion of Eric W. Weisstein, Jul 02 2004

A126197 GCDs arising in A126196.

Original entry on oeis.org

11, 1093, 1093, 3511, 3511, 5557, 104891, 1006003
Offset: 1

Views

Author

Max Alekseyev and Tanya Khovanova, Mar 07 2007

Keywords

Comments

All terms are primes. Note a connection to the Wieferich primes A001220: a(2) = a(3) = A001220(1), a(3) = a(4) = A001220(2).
From John Blythe Dobson, Jan 14 2017: (Start)
All Wieferich primes p will belong to this sequence twice, because if H([p/k]) denotes the harmonic number with index floor(p/k), then p divides all of H([p/4]), H([p/2]), and H(p-1). The first two of these elements gives one solution, and the second and third another. This property of the Wieferich primes predates their name, and was apparently first proved by Glaisher in "On the residues of r^(p-1) to modulus p^2, p^3, etc.," pp. 21-22, 23 (see References).
Note also a connection to the Mirimanoff primes A014127: a(1) = A014127(1), a(8) = A014127(2). All Mirimanoff primes p will belong to this sequence, because p divides both H([p/3]) and H([2p/3]). This property of the Mirimanoff primes likewise predates their name, and was apparently first proved by Glaisher in "A general congruence theorem relating to the Bernoullian function," p. 50 (see Links).
The Wieferich primes and Mirimanoff primes would seem to be the only cases for which the value of n in A126196(n) is predictable from knowledge of p. It is not obvious that all members of the present sequence are prime; however, by definition all their divisors must be non-harmonic primes A092102. Furthermore, it is clear from the cited literature under that entry that H([n/2]) == H(n) == 0 (mod p) is only possible when n < p. Thus, all divisors of the present sequence must belong to the harmonic irregular primes A092194.
One possible reason for interest in this sequence is a 1995 result of Dilcher and Skula (see Links) which among other things shows that if a prime p were an exception to the first case of Fermat's Last Theorem, then p would divide both H([p/k]) and H([2p/k]) for every value of k from 2 to 46. To date, the only values for which such coincidences have been found have k = 2, 3, or 4. For k = 6 to hold, p would have to be simultaneously a Wieferich prime and a Mirimanoff prime, while for k = 5 to hold, p would have to be simultaneously a Wall-Sun-Sun prime and a member of A123692. The sparse numerical results for the present sequence suggest that even the more relaxed condition H([n/2]) == H(n) == 0 (mod p) is rarely satisfied. (End)

References

  • J. W. L. Glaisher, On the residues of r^(p-1) to modulus p^2, p^3, etc., Quarterly Journal of Pure and Applied Mathematics 32 (1900-1901), 1-27.

Crossrefs

Programs

  • Mathematica
    f[n_] := GCD @@ Numerator@ HarmonicNumber@ {n, Floor[n/2]}; f@ Select[ Range[5000], f[#] > 1 &] (* Giovanni Resta, May 13 2016 *)

Extensions

a(8) from Giovanni Resta, May 13 2016

A125581 Numbers n such that n does not divide the denominator of the n-th harmonic number nor the denominator of the n-th alternating harmonic number.

Original entry on oeis.org

77, 847, 9317, 102487, 596778, 1127357, 1193556, 6161805, 12323610, 12400927
Offset: 1

Views

Author

Alexander Adamchuk, Jan 03 2007

Keywords

Comments

Note that a(1) = 7*11, a(2) = 7*11^2, and a(3) = 7*11^3.
Harmonic numbers are defined as H(n) = Sum_{k=1..n} 1/k = A001008(n)/A002805(n).
Alternating harmonic numbers are defined as H'(n) = Sum_{k=1..n} (-1)^(k+1)*1/k = A058313(n)/A058312(n).
Numbers n such that n does not divide the denominator of the n-th harmonic number are listed in A074791. Numbers n such that n does not divide the denominator of the n-th alternating harmonic number are listed in A121594.
This sequence is the intersection of A074791 and A121594.
Comments from Max Alekseyev, Mar 07 2007: (Start)
While A125581 indeed contains the geometric progression 7*11^n as a subsequence, it also contains other geometric progressions such as: 546*1093^n, 1092*1093^n, 1755*3511^n, 3510*3511^n and 4896*5557^n (see A126196 and A126197). It may also contain some "isolated" terms (i.e. not participating in the geometric progressions) but such terms are harder to find and at the moment I have no proof that they exist.
This is a sketch of my proof that geometric progression 7*11^n and the others mentioned above belong to A125581.
Lemma 1. H'(n) = H(n) - H([n/2]).
Lemma 2. For prime p and integer n >= p, valuation(H(n),p) >= valuation(H([n/p]),p) - 1.
Theorem. For an integer b > 1 and a prime number p such that p divides the numerators of both H(b) and H([b/2]), the geometric progression b*p^n belongs to A125581.
Proof. It is enough to show that valuation(H(b*p^n),p) > -n and valuation(H'(b*p^n), p) > -n. By Lemma 2 we have valuation(H(b*p^n), p) >= valuation(H(b), p) - n >= 1 - n > -n.
From this inequality and Lemma 1, we have valuation(H'(b*p^n), p) >= min{ valuation(H(b*p^n), p), valuation(H([b*p^n/2]), p) } >= min{ 1 - n, valuation(H([b*p^n/2]), p) }. It remains to show that valuation(H([b*p^n/2]), p) >= 1 - n.
Again by Lemma 2, we have valuation(H([b*p^n/2]), p) >= valuation(H([b/2]), p) - n >= 1 - n, which completes the proof.
It is easy to check that this Theorem holds for the aforementioned geometric progressions. (End)

Crossrefs

Programs

  • Mathematica
    f=0; g=0; Do[g=g+1/n; f=f+(-1)^(n+1)/n; If[ !IntegerQ[Denominator[g]/n]&&!IntegerQ[Denominator[f]/n], Print[n]], {n, 1, 10000}]

Extensions

More terms from Max Alekseyev, Mar 11 2007
a(8)-a(10) from Max Alekseyev, Mar 19 2007

A126196 Numbers k such that gcd(A001008(k), A001008(floor(k/2))) > 1.

Original entry on oeis.org

7, 546, 1092, 1755, 3510, 4896, 52447, 670668
Offset: 1

Views

Author

Max Alekseyev and Tanya Khovanova, Mar 07 2007, corrected Mar 10 2007

Keywords

Comments

Note a connection to the Wieferich primes A001220: a(2) = (A001220(1) - 1)/2, a(3) = A001220(1) - 1, a(4) = (A001220(2) - 1)/2, a(5) = A001220(2) - 1. [Comment regarding a(2) added by Kevin J. Gomez, Jul 11 2017]
a(9) > 840000. - Giovanni Resta, May 13 2016

Crossrefs

The corresponding GCDs are given by A126197.

Programs

  • Mathematica
    Select[Range[5000], GCD @@ Numerator@ HarmonicNumber@{#, Floor[#/2]} > 1 &] (* Giovanni Resta, May 13 2016 *)
  • PARI
    a001008(n)=numerator(sum(i=1, n, 1/i))
    for(n=1, 1e6, if(gcd(a001008(n), a001008(n/2)) > 1, print1(n, ", "))) \\ Felix Fröhlich, Aug 08 2014

Extensions

a(8) from Giovanni Resta, May 13 2016

A121594 Numbers k such that k does not divide the denominator of the k-th alternating Harmonic number.

Original entry on oeis.org

15, 28, 75, 77, 104, 187, 196, 203, 210, 222, 228, 235, 238, 328, 345, 375, 551, 620, 847, 888, 1036, 1107, 1204, 1349, 1352, 1372, 1391, 1430, 1457, 1469, 1470, 1498, 1666, 1687, 1855, 1875, 2133, 2301, 2425, 2440, 2556, 2678, 2948, 3179, 3337, 3477
Offset: 1

Views

Author

Alexander Adamchuk, Aug 09 2006

Keywords

Comments

Indices k such that A119788(k) is not equal to 1.
Also indices k such that numerators of k*H'(k) = A119787(k) and H'(k) = A058313(k) are different (H'(k) is the alternating harmonic number H'(k) = Sum_{j=1..k} (-1)^(j+1)*1/j). The ratio of numerators A119787(k)/A058313(k) for k = 1..400 is given in A119788(k). A121595(k) = A119788(a(k)) is the compressed version of A119788(k) (all 1 entries are excluded).

Crossrefs

Cf. A058312 = Denominator of the n-th alternating harmonic number, Sum_{k=1..n} (-1)^(k+1)/k. A074791 = numbers k such that k does not divide the denominator of the k-th Harmonic number.

Programs

  • Mathematica
    Do[H=Sum[(-1)^(i+1)*1/i, {i, 1, n}]; a=Numerator[n*H]; b=Numerator[H]; If[ !Equal[a,b],Print[{n,a/b}]],{n,1,6000}]
    f=0;Do[f=f+(-1)^(n+1)/n;If[ !IntegerQ[Denominator[f]/n],Print[n]],{n,1,100}] (* Alexander Adamchuk, Jan 02 2007 *)

A128438 a(n) = floor((denominator of H(n))/n), where H(n) = Sum_{k=1..n} 1/k, the n-th harmonic number.

Original entry on oeis.org

1, 1, 2, 3, 12, 3, 20, 35, 280, 252, 2520, 2310, 27720, 25740, 24024, 45045, 720720, 226893, 4084080, 775975, 246341, 235144, 5173168, 14872858, 356948592, 343219800, 2974571600, 2868336900, 80313433200, 77636318760, 2329089562800
Offset: 1

Views

Author

Leroy Quet, Mar 03 2007

Keywords

Comments

This is very similar to A027611, which is a different sequence. - N. J. A. Sloane, Nov 21 2008
Indices where a(n) differs from A027611 are terms of A074791. - Gary Detlefs, Sep 03 2011

Examples

			The sequence denominator(H(n))/n begins 1, 1, 2, 3, 12, 10/3, 20, 35, 280, 252, 2520, 2310, ..., so the present sequence begins 1, 1, 2, 3, 12, 3, 20, 35, 280, 252, 2520, 2310, ...
		

Crossrefs

Programs

  • Maple
    H:=n->sum(1/k,k=1..n): a:=n->floor(denom(H(n))/n): seq(a(n),n=1..34); # Emeric Deutsch, Mar 25 2007
  • Mathematica
    seq = {}; s = 0; Do[s += 1/n; AppendTo[seq, Floor[Denominator[s]/n]], {n, 1, 30}]; seq (* Amiram Eldar, Sep 18 2021 *)
    Table[Floor[Denominator[HarmonicNumber[n]]/n],{n,40}] (* Harvey P. Dale, Nov 24 2023 *)
  • Python
    from sympy import harmonic
    def A128438(n): return harmonic(n).q//n # Chai Wah Wu, Sep 27 2021

Extensions

More terms from Emeric Deutsch, Mar 25 2007

A120263 Ratio of the numerator of n*HarmonicNumber[n] to the numerator of HarmonicNumber[n]: A096617(n)/A001008(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1
Offset: 1

Views

Author

Alexander Adamchuk, Jun 26 2006

Keywords

Comments

a(n) is not equal to 1 when n belongs to A074791 - numbers n such that n does not divide the denominator of the n-th harmonic number.
a(n) is almost always equal to 1 except for n=6,18,20,21,33,42,54,.. when a(n) seems to be equal to a prime divisor of n.
a(n) could be equal to a squared prime divisor of n as for n=100,294,500,847,..

Crossrefs

Programs

  • Magma
    [Numerator(n*HarmonicNumber(n))/Numerator(HarmonicNumber(n)): n in [1..100]]; // G. C. Greubel, Sep 01 2018
  • Mathematica
    Numerator[Table[n*Sum[1/i,{i,1,n}],{n,1,500}]]/Numerator[Table[Sum[1/i,{i,1,n}],{n,1,500}]]
  • PARI
    {h(n) = sum(k=1,n,1/k)};
    for(n=1,100, print1(numerator(n*h(n))/numerator(h(n)), ", ")) \\ G. C. Greubel, Sep 01 2018
    

Formula

a(n) = A096617(n)/A001008(n) = numerator[n*Sum[1/i,{i,1,n}]] / numerator[Sum[1/i,{i,1,n}]].
a(n) = n / gcd(denominator(H(n)),n), where H(n) = sum(1/k, k=1..n). [Gary Detlefs, Sep 05 2011]
a(n) = A096617(n)*A110566(n)/A025529(n). [Arkadiusz Wesolowski, Mar 29 2012]
Showing 1-7 of 7 results.