A027611 -id:A027611 - cp's OEIS frontend

A002805 Denominators of harmonic numbers H(n) = Sum_{i=1..n} 1/i.

1, 2, 6, 12, 60, 20, 140, 280, 2520, 2520, 27720, 27720, 360360, 360360, 360360, 720720, 12252240, 4084080, 77597520, 15519504, 5173168, 5173168, 118982864, 356948592, 8923714800, 8923714800, 80313433200, 80313433200, 2329089562800, 2329089562800, 72201776446800

Offset: 1

N. J. A. Sloane

H(n)/2 is the maximal distance that a stack of n cards can project beyond the edge of a table without toppling.
If n is not in {1, 2, 6} then a(n) has at least one prime factor other than 2 or 5. E.g., a(5) = 60 has a prime factor 3 and a(7) = 140 has a prime factor 7. This implies that every H(n) = A001008(n)/A002805(n), n not from {1, 2, 6}, has an infinite decimal representation. For a proof see the J. Havil reference. - Wolfdieter Lang, Jun 29 2007
a(n) = A213999(n,n-1). - Reinhard Zumkeller, Jul 03 2012
From Wolfdieter Lang, Apr 16 2015: (Start)
a(n)/A001008(n) = 1/H(n) is the solution of the following version of the classical cistern and pipes problem. A cistern is connected to n different pipes of water. For the k-th pipe it takes k time units (say, days) to fill the empty cistern, for k = 1, 2, ..., n. How long does it take for the n pipes together to fill the empty cistern? 1/H(n) gives the answer as a fraction of the time unit.
In general, if the k-th pipe needs d(k) days to fill the empty cistern then all pipes together need 1/Sum_{k=1..n} 1/d(k) = HM(d(1), ..., d(n))/n days, where HM denotes the harmonic mean HM. For the described problem, HM(1, 2, ..., n)/n = A102928(n)/(n*A175441(n)) = 1/H(n).
For a classical cistern and pipes problem see, e.g., the Hunger-Vogel reference (in Greek and German) given in A256101, problem 27, p. 29, where n = 3, and d(1), d(2) and d(3) are 6, 4 and 3 days. On p. 97 of this reference one finds remarks on the history of such problems (called in German 'Brunnenaufgabe'). (End)
From Wolfdieter Lang, Apr 17 2015: (Start)
An example of the above mentioned cistern and pipes problems appears in Chiu Chang Suan Shu (nine books on arithmetic) in book VI, problem 26. The numbers are there 1/2, 1, 5/2, 3 and 5 (days) and the result is 15/75 (day). See the reference (in German) on p. 68.
A historical account on such cistern problems is found in the Johannes Tropfke reference, given in A256101, section 4.2.1.2 Zisternenprobleme (Leistungsprobleme), pp. 578-579.
In Fibonacci's Liber Abaci such problems appear on p. 281 and p. 284 of L. E. Sigler's translation. (End)
All terms > 1 are even while corresponding numerators (A001008) are all odd (proof in Pólya and Szegő). - Bernard Schott, Dec 24 2021

			H(n) = [ 1, 3/2, 11/6, 25/12, 137/60, 49/20, 363/140, 761/280, 7129/2520, ... ] = A001008/A002805.

Chiu Chang Suan Shu, Neun Bücher arithmetischer Technik, translated and commented by Kurt Vogel, Ostwalds Klassiker der exakten Wissenschaften, Band 4, Friedr. Vieweg & Sohn, Braunschweig, 1968, p. 68.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 258-261.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 259.
J. Havil, Gamma, (in German), Springer, 2007, p. 35-6; Gamma: Exploring Euler's Constant, Princeton Univ. Press, 2003.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 1, p. 615.
G. Pólya and G. Szegő, Problems and Theorems in Analysis, volume II, Springer, reprint of the 1976 edition, 1998, problem 251, p. 154.
L. E. Sigler, Fibonacci's Liber Abaci, Springer, 2003, pp. 281, 284.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Kenny Lau, Table of n, a(n) for n = 1..2308 [First 200 terms computed by T. D. Noe]
R. M. Dickau, Harmonic numbers and the book stacking problem.
Haight, Frank A., and Robert B. Jones., "A probabilistic treatment of qualitative data with special reference to word association tests." Journal of Mathematical Psychology 11.3 (1974): 237-244. [Annotated scanned copy]
Frank Haight and N. J. A. Sloane, Correspondence, 1975.
Antal Iványi, Leader election in synchronous networks, Acta Univ. Sapientiae, Mathematica, 5, 2 (2013) 54-82.
Fredrik Johansson, How (not) to compute harmonic numbers, Feb 21 2009.
Peter Shiu, The denominators of harmonic numbers, arXiv:1607.02863 [math.NT], 2016.
N. J. A. Sloane, Illustration of initial terms.
Jonathan Sondow and Eric W. Weisstein, MathWorld: Harmonic Number.
Eric Weisstein's World of Mathematics, Book Stacking Problem.
Bing-Ling Wu, Yong-Gao Chen, On the denominators of harmonic numbers, arXiv:1711.00184 [math.NT], 2017.

Cf. A001008 (numerators), A075135, A025529, A203810, A203811, A203812.
Partial sums: A027612/A027611 = 1, 5/2, 13/3, 77/12, 87/10, 223/20,...
The following fractions are all related to each other: Sum 1/n: A001008/A002805, Sum 1/prime(n): A024451/A002110 and A106830/A034386, Sum 1/nonprime(n): A282511/A282512, Sum 1/composite(n): A250133/A296358, Sum 1/n^2: A007406/A007407, Sum 1/n^3: A007408/A007409.

List([1..30],n->DenominatorRat(Sum([1..n],i->1/i))); # Muniru A Asiru, Dec 20 2018

import Data.Ratio ((%), denominator)
a002805 = denominator . sum . map (1 %) . enumFromTo 1
a002805_list = map denominator $ scanl1 (+) $ map (1 %) [1..]
-- Reinhard Zumkeller, Jul 03 2012

[Denominator(HarmonicNumber(n)): n in [1..40]]; // Vincenzo Librandi, Apr 16 2015

seq(denom(sum((2*k-1)/k, k=1..n), n=1..30); # Gary Detlefs, Jul 18 2011
f:=n->denom(add(1/k, k=1..n)); # N. J. A. Sloane, Nov 15 2013

Denominator[ Drop[ FoldList[ #1 + 1/#2 &, 0, Range[ 30 ] ], 1 ] ] (* Harvey P. Dale, Feb 09 2000 *)
Table[Denominator[HarmonicNumber[n]], {n, 1, 40}] (* Stefan Steinerberger, Apr 20 2006 *)
Denominator[Accumulate[1/Range[25]]] (* Alonso del Arte, Nov 21 2018 *)

a(n)=denominator(sum(k=2,n,1/k)) \\ Charles R Greathouse IV, Feb 11 2011

from fractions import Fraction
def a(n): return sum(Fraction(1, i) for i in range(1, n+1)).denominator
print([a(n) for n in range(1, 30)]) # Michael S. Branicky, Dec 24 2021

def harmonic(a, b): # See the F. Johansson link.
    if b - a == 1 : return 1, a
    m = (a+b)//2
    p, q = harmonic(a,m)
    r, s = harmonic(m,b)
    return p*s+q*r, q*s
def A002805(n) : H = harmonic(1,n+1); return denominator(H[0]/H[1])
[A002805(n) for n in (1..29)] # Peter Luschny, Sep 01 2012

a(n) = Denominator(Sum_{k=1..n} (2*k-1)/k). - Gary Detlefs, Jul 18 2011
a(n) = n! / gcd(Stirling1(n+1, 2), n!) = n! / gcd(A000254(n),n!). - Max Alekseyev, Mar 01 2018
a(n) = the (reduced) denominator of the continued fraction 1/(1 - 1^2/(3 - 2^2/(5 - 3^2/(7 - ... - (n-1)^2/(2*n-1))))). - Peter Bala, Feb 18 2024

Definition edited by Daniel Forgues, May 19 2010

A014234 Largest prime <= 2^n.

Original entry on oeis.org

2, 3, 7, 13, 31, 61, 127, 251, 509, 1021, 2039, 4093, 8191, 16381, 32749, 65521, 131071, 262139, 524287, 1048573, 2097143, 4194301, 8388593, 16777213, 33554393, 67108859, 134217689, 268435399, 536870909, 1073741789, 2147483647, 4294967291, 8589934583, 17179869143, 34359738337, 68719476731, 137438953447

Offset: 1

Jud McCranie

nonn

For n>1 largest prime factor of the denominator of A027611(2^n) = 2^n*(2^n)-th harmonic number. - Alexander Adamchuk, Aug 02 2006

D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 2, p. 390.

T. D. Noe, Table of n, a(n) for n=1..1000
Fred Curtis, C++ program for A014234
Harry J. Smith, PrimePi2 - Computes the Prime Pi(x) counting function [Broken link]
Harry J. Smith, PrimePi2 - Computes the Prime Pi(x) counting function [Cached copy]

Cf. A000079, A014210.
Cf. A013603 (2^n - a(n)).
See comment for the relationship to A027611.
These primes have indices A007053 = number of primes <= 2^n.
The opposite is A104080, delta A092131, indices A372684.
For squarefree instead of prime we have A372889, indices A143658.
A036378 counts primes between powers of 2, A293697 adds them up.
Cf. A035100, A130739, A211997.

a:= n-> prevprime(2^n+1):
seq(a(n), n=1..40);  # Alois P. Heinz, Apr 23 2020

PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; Table[ Abs[ PrevPrim[2^n]], {n, 1, 30} ]
Join[{2},NextPrime[2^Range[2,40],-1]] (* Harvey P. Dale, Jun 26 2011 *)

a(n) = precprime(2^n) \\ Michel Marcus, Aug 08 2013

Terms for n=31, n=32 added by Fred Curtis (fred(AT)f2.org), Dec 08 2009

A027612 Numerator of 1/n + 2/(n-1) + 3/(n-2) + ... + (n-1)/2 + n.

Original entry on oeis.org

1, 5, 13, 77, 87, 223, 481, 4609, 4861, 55991, 58301, 785633, 811373, 835397, 1715839, 29889983, 30570663, 197698279, 201578155, 41054655, 13920029, 325333835, 990874363, 25128807667, 25472027467, 232222818803, 235091155703, 6897956948587, 6975593267347

Offset: 1

Glen Burch (gburch(AT)erols.com)

Numerator of a second-order harmonic number H(n, (2)) = Sum_{k=1..n} HarmonicNumber(k). - Alexander Adamchuk, Apr 12 2006
p divides a(p-3) for prime p > 3. - Alexander Adamchuk, Jul 06 2006
Denominator is A027611(n+1). p divides a(p-3) for prime p > 3. - Alexander Adamchuk, Jul 26 2006
a(n) = A213998(n,n-2) for n > 1. - Reinhard Zumkeller, Jul 03 2012

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Harmonic Number.

Cf. A001008, A001705, A002805, A006675, A022819, A027611, A093418.

import Data.Ratio ((%), numerator)
a027612 n = numerator $ sum $ zipWith (%) [1 .. n] [n, n-1 .. 1]
-- Reinhard Zumkeller, Jul 03 2012

[Numerator((&+[j/(n-j+1): j in [1..n]])): n in [1..30]]; // G. C. Greubel, Aug 23 2022

a := n -> numer(add((n+1-j)/j, j=1..n));
seq(a(n), n = 1..29); # Peter Luschny, May 12 2023

Numerator[Table[Sum[Sum[1/i,{i,1,k}],{k,1,n}],{n,1,30}]] (* Alexander Adamchuk, Apr 12 2006 *)
Numerator[Table[Sum[k/(n-k+1),{k,1,n}],{n,1,50}]] (* Alexander Adamchuk, Jul 26 2006 *)

a(n) = numerator(sum(k=1, n, k/(n-k+1))); \\ Michel Marcus, Jul 14 2018

[numerator(n*(harmonic_number(n+1) - 1)) for n in (1..30)] # G. C. Greubel, Aug 23 2022

From Vladeta Jovovic, Sep 02 2002: (Start)
a(n) = numerators of coefficients in expansion of -log(1-x)/(1-x)^2.
a(n) = numerators of (n+1)*(harmonic(n+1) - 1).
a(n) = numerators of (n+1)*(Psi(n+2) + Euler-gamma - 1). (End)
a(n) = numerator( Sum_{k=1..n} Sum_{i=1..k} 1/i ). - Alexander Adamchuk, Apr 12 2006
a(n) = numerator( Sum_{k=1..n} k/(n-k+1) ). - Alexander Adamchuk, Jul 26 2006
a(n) = numerator of integral_{x=1..n+1} floor((n+1)/x). - Jean-François Alcover, Jun 18 2013

A064169 Numerator - denominator in n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.

Original entry on oeis.org

0, 1, 5, 13, 77, 29, 223, 481, 4609, 4861, 55991, 58301, 785633, 811373, 835397, 1715839, 29889983, 10190221, 197698279, 40315631, 13684885, 13920029, 325333835, 990874363, 25128807667, 25472027467, 232222818803, 235091155703, 6897956948587, 6975593267347

Offset: 1

Leroy Quet, Sep 19 2001

nonn

The numerator and denominator in the definition have no common factors greater than 1. p divides a(p-2) for prime p > 2. - Alexander Adamchuk, Jun 09 2006
It appears that a(n) = numerator((3*(HarmonicNumber(n) - 1)) / (n*(n^2 + 6*n + 11))), except for n = 5, 82, 115, and 383 (tested to 20000). - Gary Detlefs, Jul 20 2011
From Amiram Eldar and Thomas Ordowski, Jul 27 2019: (Start)
Conjecture: for n > 2, n divides a(n-2) if and only if n is a prime. Checked up to 20000.
Max Alekseyev proved (in priv. commun.) that there are no primes p > 3 such that p^2 divides a(p-2). (End)

			The 3rd harmonic number is 11/6. So a(3) = 11 - 6 = 5.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Harmonic Number

Cf. A001008, A002805, A064167, A064168.

List([1..35], n-> NumeratorRat(Sum([0..n-2], k-> 2/(k+2))) ); # G. C. Greubel, Jul 27 2019

[Numerator(a)-Denominator(a) where a is HarmonicNumber(n): n in [1..35]]; // Marius A. Burtea, Aug 03 2019

s := n -> add(1/i, i=2..n): a := n -> numer(s(n)):
seq(a(n), n=1..30); # Zerinvary Lajos, Mar 28 2007

A064169[n_]:= (s = Sum[1/k, {k, n}]; Numerator[s] - Denominator[s]); Table[A064169[n], {n, 35}]
Numerator[Table[Sum[1/k, {k, 2, n}], {n, 35}]] (* Alexander Adamchuk, Jun 09 2006 *)
Numerator[#] - Denominator[#] &/@ HarmonicNumber[Range[35]] (* Harvey P. Dale, Apr 25 2016 *)
Numerator[Accumulate[1/Range[2, 35]]] (* Alonso del Arte, Nov 21 2018 *)
a[n_] := Numerator[PolyGamma[1 + n] + EulerGamma - 1];
Table[a[n], {n, 1, 29}] (* Peter Luschny, Feb 19 2022 *)

a(n) = my(h=sum(i=1, n, 1/i)); numerator(h)-denominator(h) \\ Felix Fröhlich, Jan 14 2019

from sympy import harmonic
def A064169(n): return (lambda x: x.p - x.q)(harmonic(n)) # Chai Wah Wu, Sep 27 2021

[numerator(harmonic_number(n)) - denominator(harmonic_number(n)) for n in (1..35)] # G. C. Greubel, Jul 27 2019

Numerator of (gamma + Psi(n+1) - 1). - Vladeta Jovovic, Aug 12 2002
From Alexander Adamchuk, Jun 09 2006: (Start)
a(n) = numerator of Sum_{k = 2..n} 1/k.
a(n) = A001008(n) - A002805(n).
a(n) = numerator of (the n-th harmonic number minus 1).
a(n) = numerator of A001008(n)/A002805(n) - 1. (End)
a(n) = numerator of A027612(n-1)/(A027611(n)*n^2*(n-1)!), n > 1. - Gary Detlefs, Aug 05 2011
a(n) = numerator(Sum_{k = 1..n-1} 1/(3*k + 3)). - Gary Detlefs, Sep 14 2011
a(n) = numerator(Sum_{k = 0..n-1} 2/(k+2)). - Gary Detlefs, Oct 06 2011
a(n) = numerator(Sum_{k = 1..n} frac(1/k)). - Michel Marcus, Sep 27 2021

One more term from Robert G. Wilson v, Sep 28 2001

More terms from Vladeta Jovovic, Aug 12 2002

A213999 Denominators of the triangle of fractions read by rows: pf(n,0) = 1, pf(n,n) = 1/(n+1) and pf(n+1,k) = pf(n,k) + pf(n,k-1) with 0 < k < n; denominators: A213998.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 2, 6, 4, 1, 2, 3, 12, 5, 1, 2, 6, 12, 60, 6, 1, 2, 3, 4, 10, 20, 7, 1, 2, 6, 12, 20, 20, 140, 8, 1, 2, 3, 12, 15, 10, 35, 280, 9, 1, 2, 6, 4, 20, 30, 70, 280, 2520, 10, 1, 2, 3, 12, 10, 12, 21, 56, 252, 2520, 11, 1, 2, 6, 12, 60, 60, 84, 168, 504, 2520, 27720, 12

Offset: 0

Reinhard Zumkeller, Jul 03 2012

T(n,0) = 1;
T(n,1) = A007395(n) for n > 0;
T(n,2) = A010704(n) for n > 1;
T(n,n-3) = A124838(n-2) for n > 2;
T(n,n-2) = A027611(n-1) for n > 1;
T(n,n-1) = A002805(n) for n > 0;
T(n,n) = n + 1;
A003418(n+1) = least common multiple of n-th row;
A214075(n,k) = floor(A213998(n,k) / T(n,k)).

			See A213998.

Reinhard Zumkeller, Rows n = 0..150 of triangle, flattened
Index entries for triangles and arrays related to Pascal's triangle

import Data.Ratio ((%), denominator, Ratio)
a213999 n k = a213999_tabl !! n !! k
a213999_row n = a213999_tabl !! n
a213999_tabl = map (map denominator) $ iterate pf [1] where
   pf row = zipWith (+) ([0] ++ row) (row ++ [-1 % (x * (x + 1))])
            where x = denominator $ last row

T[, 0] = 1; T[n, n_] := 1/(n + 1);
T[n_, k_] := T[n, k] = T[n - 1, k] + T[n - 1, k - 1];
Table[T[n, k] // Denominator, {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 10 2021 *)

A124837 Numerators of third-order harmonic numbers (defined by Conway and Guy, 1996).

Original entry on oeis.org

1, 7, 47, 57, 459, 341, 3349, 3601, 42131, 44441, 605453, 631193, 655217, 1355479, 23763863, 24444543, 476698557, 162779395, 166474515, 34000335, 265842403, 812400067, 20666950267, 21010170067, 192066102203, 194934439103

Offset: 1

Jonathan Vos Post, Nov 10 2006

Denominators are A124838. All fractions reduced. Thanks to Jonathan Sondow for verifying these calculations. He suggests that the equivalent definition in terms of first order harmonic numbers may be computationally simpler. We are happy with the description of A027612 Numerator of 1/n + 2/(n-1) + 3/(n-2) + ... + (n-1)/2 + n, but baffled by the description of A027611.
From Alexander Adamchuk, Nov 11 2006: (Start)
a(n) is the numerator of H(n, (3)) = Sum_{m=1..n} Sum_{k=1..m} HarmonicNumber(k).
Denominators are listed in A124838.
p divides a(p-5) for prime p > 5.
Primes are listed in A129880.
Numbers k such that a(k) is prime are listed in A129881. (End)

			a(1) = 1 = numerator of 1/1.
a(2) = 7 = numerator of 1/1 + 5/2 = 7/2.
a(3) = 47 = numerator of 7/2 + 13/3 = 47/6.
a(4) = 57 = numerator of 47/6 + 77/12 = 57/4.
a(5) = 549 = numerator of 57/4 + 87/10 = 549/20.
a(6) = 341 = numerator of 549/20 + 223/20 = 341/10
a(7) = 3349 = numerator of 341/10 + 481/35 = 3349/70.
a(8) = 88327 = numerator of 3349/70 + 4609/280 = 88327/1260.
a(9) = 3844 = numerator of 88327/1260 + 4861/252 = 3844/45.
a(10) = 54251 = numerator of 3844/45 + 55991/2520 = 54251/504, or, untelescoping:
a(10) = 54251 = numerator of 1/1 + 5/2 + 13/3 + 77/12 + 87/10 + 223/20 + 481/35 + 4609/252 + 4861/252 + 55991/2520 = 54251/504.

J. H. Conway and R. K. Guy, The Book of Numbers, New York: Springer-Verlag, pp. 143 and 258-259, 1996.

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Harmonic Number. See equation for third order harmonic numbers.

Cf. A027611, A027612, A124838.

Cf. A001008, A002805, A067657, A056903, A124878, A124879, A124837, A129880, A129881.

a124837 n = a213998 (n + 2) (n - 1) -- Reinhard Zumkeller, Jul 03 2012

Table[Numerator[(n+2)!/2!/n!*Sum[1/k,{k,3,n+2}]],{n,1,30}] (* Alexander Adamchuk, Nov 11 2006 *)

A124837(n)/A124838(n) = Sum{i=1..n} A027612(n)/A027611(n+1).
From Alexander Adamchuk, Nov 11 2006: (Start)
a(n) = numerator(Sum_{m=1..n} Sum_{l=1..m} Sum_{k=1..l} 1/k).
a(n) = numerator(((n+2)!/(2!*n!)) * Sum_{k=3..n+2} 1/k).
a(n) = numerator(((n+2)*(n+1)/2) * Sum_{k=3..n+2} 1/k). (End)
a(n) = numerator(Sum_{k=0..n-1} (-1)^k*binomial(-3,k)/(n-k)). - Gary Detlefs, Jul 18 2011
a(n) = A213998(n+2,n-1). - Reinhard Zumkeller, Jul 03 2012

Corrected and extended by Alexander Adamchuk, Nov 11 2006

cp's OEIS Frontend

A081526 Erroneous version of A027611.

Views

Author

Keywords

Crossrefs

Formula

Extensions

A075711 Duplicate of A027611.

Views

Author

Keywords

A079077 Duplicate of A027611.

Views

Author

Keywords

A119526 Odd denominators of n * n-th harmonic number = A027611[2^n].

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A002805 Denominators of harmonic numbers H(n) = Sum_{i=1..n} 1/i.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

Extensions

A014234 Largest prime <= 2^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A027612 Numerator of 1/n + 2/(n-1) + 3/(n-2) + ... + (n-1)/2 + n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

SageMath

Formula

A064169 Numerator - denominator in n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.

Views

Author

Keywords

Comments

Examples

Links