A227610 -id:A227610 - cp's OEIS frontend

A004194 Number of partitions of 1/n into 3 reciprocals of positive integers.

3, 10, 21, 28, 36, 57, 42, 70, 79, 96, 62, 160, 59, 136, 196, 128, 73, 211, 80, 292, 245, 157, 93, 366, 156, 174, 230, 340, 106, 497, 90, 269, 322, 211, 453, 538, 85, 216, 378, 604, 121, 623, 104, 473, 648, 204, 135, 706, 227, 437, 387, 467, 125, 601, 561, 783, 385

Offset: 1

Scott Aaronson (philomath(AT)voicenet.com)

nonn

Number of ways to express 1/n as Egyptian fractions in just three terms; i.e., 1/n = 1/x + 1/y + 1/z satisfying 1<=x<=y<=z.

See A073101 for the 4/n conjecture due to Erdős and Straus.

Justus Springer, Table of n, a(n) for n = 1..5000 (terms 1..100 from Robert G. Wilson)
K. S. Brown, Unit Fraction Partitions
Index entries for sequences related to Egyptian fractions

Cf. A227610, A226641, A226642, A192787, A226644, A226645, A226646.

a[n_] := Length@ Solve[ 1/n == 1/x + 1/y + 1/z && 1 <= x <= y <= z, {x, y, z}, Integers]; Array[a, 70] (* Allan C. Wechsler and Robert G. Wilson v, Aug 17 2013 *)

a(n)=my(t=1/n, t1, s, c); for(a=1\t+1, 3\t, t1=t-1/a; for(b=max(1\t1+1, a), 2\t1, c=1/(t1-1/b); if(denominator(c)==1&&c>=b, s++))); s \\ Charles R Greathouse IV, Jun 12 2013

More terms from David W. Wilson, Aug 15 1996

A241883 Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.

Original entry on oeis.org

6, 71, 272, 586, 978, 1591, 1865, 3115, 3772, 4964, 4225, 8433, 4987, 10667, 13659, 10845, 7513, 17360, 9569, 28554, 23309, 17220, 12326, 37554, 19984, 24091, 31056, 42343, 16095, 57001, 15076, 42655, 46885, 38416, 77887, 71959, 16692, 42054, 68894, 95914, 24566, 100023, 24224, 99437, 108756, 41907, 29711, 127069, 52811, 94745, 83433

Offset: 1

Robert G. Wilson v, Apr 30 2014

nonn

			1/1 = 1/2 + 1/3 + 1/7  + 1/42
    = 1/2 + 1/3 + 1/8  + 1/24
    = 1/2 + 1/3 + 1/9  + 1/18
    = 1/2 + 1/3 + 1/10 + 1/15
    = 1/2 + 1/4 + 1/5  + 1/20
    = 1/2 + 1/4 + 1/6  + 1/12
so a(1) = 6.

Jud McCranie, Table of n, a(n) for n = 1..644

Cf. A002966, A004194, A020327, A227610.

a[n_] := Length@ Solve[1/n == 1/w + 1/x + 1/y + 1/z && 0 < w < x < y < z, {w, x, y, z}, Integers]; Array[f, 21]

A349083 The number of three-term Egyptian fractions of rational numbers x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r) such that x/y = 1/p + 1/q + 1/r where p, q, and r are integers with p < q < r.

Original entry on oeis.org

6, 15, 5, 22, 6, 3, 30, 9, 7, 2, 45, 15, 6, 5, 1, 36, 14, 6, 5, 3, 1, 62, 22, 16, 6, 5, 3, 2, 69, 21, 15, 4, 9, 5, 2, 1, 84, 30, 15, 9, 6, 7, 2, 2, 1, 56, 22, 13, 7, 3, 5, 2, 0, 0, 0, 142, 45, 22, 15, 12, 6, 9, 5, 3, 1, 2, 53, 17, 8, 4, 5, 1, 6, 3, 1, 1, 1, 0, 124, 36, 27, 14, 18, 6, 6, 5, 2, 3, 1, 1, 0

Offset: 1

Jud McCranie, Nov 09 2021

The sequence are the terms in a triangle, where the rows correspond to the denominator of the rational number (starting with row 2, column 1) and the columns correspond to the numerators:
            x = 1   2   3   4   5   Rationals x/y:
Row 1: (y=2)    6                   1/2
Row 2: (y=3)   15,  5               1/3, 2/3
Row 3: (y=4)   22,  6,  3           1/4, 2/4, 3/4
Row 4: (y=5)   30,  9,  7,  2       1/5, 2/5, 3/5, 4/5
Row 5: (y=6)   45, 15,  6,  5,  1   1/6, 2/6, 3/6, 4/6, 5/6
Alternatively, order the rational numbers, x/y, 0 < x/y < 1, in this order: 1/2, 1/3, 2/3, 1/4, 2/4, 3/4, 1/5, 2/5, ... The numerators of the n-th rational number are A002260(n) and the denominators are A003057(n).

			The sixth rational number is 3/4;
  3/4 = 1/2 + 1/5 + 1/20
      = 1/2 + 1/6 + 1/12
      = 1/3 + 1/4 + 1/5,
so a(6)=3.

Jud McCranie, Table of n, a(n) for n = 1..990

Cf. A002260, A003057, A349082.

Columns x=1..5: A227610, A227611, A075785, A073101, A075248.

Efrac3(x,y)=sum(p=if(y%x,y\x,y\x+1),3*y\x, my(N=x/y-1/p); sum(q=max(if(numerator(N)==1,1\N+1,1\N),p+1),2\N, my(M=N-1/q,r=1/M); type(r)=="t_INT" && qCharles R Greathouse IV, Nov 09 2021

A227611 Number of ways 2/n can be expressed as the sum of three distinct unit fractions: 2/n = 1/x + 1/y + 1/z with 0 < x < y < z.

Original entry on oeis.org

0, 1, 5, 6, 9, 15, 14, 22, 21, 30, 22, 45, 17, 36, 72, 62, 22, 69, 29, 84, 77, 56, 39, 142, 48, 53, 82, 124, 30, 178, 34, 118, 94, 67, 176, 191, 29, 74, 151, 274, 37, 227, 37, 145, 220, 87, 57, 342, 80, 146, 138, 162, 39, 216, 214, 322, 134, 100, 73, 461, 31, 84, 316, 257, 197, 304, 47, 199, 166, 435, 69, 508, 34, 79, 317

Offset: 1

Robert G. Wilson v, Jul 17 2013

nonn

See A073101 for the 4/n conjecture due to Erdős and Straus.

Cf. A002966, A073546.

Cf. A227610 (1/n), A075785 (3/n), A073101 (4/n), A075248 (5/n), A227612.

f[n_] := Length@ Solve[2/n == 1/x + 1/y + 1/z && 0 < x < y < z, {x, y, z}, Integers]; Array[f, 75]

A227612 Table read by antidiagonals: Number of ways m/n can be expressed as the sum of three distinct unit fractions, i.e., m/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and read by antidiagonals.

Original entry on oeis.org

1, 0, 6, 0, 1, 15, 0, 1, 5, 22, 0, 0, 1, 6, 30, 0, 0, 1, 3, 9, 45, 0, 0, 1, 1, 7, 15, 36, 0, 0, 0, 2, 2, 6, 14, 62, 0, 0, 0, 1, 1, 5, 6, 22, 69, 0, 0, 0, 1, 1, 1, 5, 16, 21, 84, 0, 0, 0, 0, 1, 1, 3, 6, 15, 30, 56, 0, 0, 0, 0, 1, 4, 1, 5, 4, 15, 22, 142, 0, 0, 0, 0, 0, 1, 1, 3, 9, 9, 13, 45, 53

Offset: 1

Robert G. Wilson v, Jul 17 2013

The main diagonal is 1, 1, 1, 1, 1, 1, 1, ..., ; i.e., 1 = 1/2 + 1/3 + 1/6.

			  m\n| 1  2   3   4   5   6   7   8   9  10  11   12  13   14   15
  ---+------------------------------------------------------------
   1 | 1  6  15  22  30  45  36  62  69  84  56  142  53  124  178  A227610
   2 | 0  1   5   6   9  15  14  22  21  30  22   45  17   36   72  A227611
   3 | 0  1   1   3   7   6   6  16  15  15  13   22   8   27   30  A075785
   4 | 0  0   1   1   2   5   5   6   4   9   7   15   4   14   33  A073101
   5 | 0  0   1   2   1   1   3   5   9   6   3   12   5   18   15  A075248
   6 | 0  0   0   1   1   1   1   3   5   7   5    6   1    6    9  n/a
   7 | 0  0   0   1   1   4   1   2   2   2   2    9   6    6    7  n/a
   8 | 0  0   0   0   1   1   1   1   1   2   0    5   3    5   15  n/a
   9 | 0  0   0   0   0   1   1   3   1   1   0    3   1    2    7  n/a
  10 | 0  0   0   0   0   1   0   2   2   1   0    1   1    3    5  n/a
.
Antidiagonals are {1}, {0, 6}, {0, 1, 15}, {0, 1, 5, 22}, {0, 0, 1, 6, 30}, {0, 0, 1, 3, 9, 45}, ...

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Christian Elsholtz, Sums Of k Unit Fractions, Trans. Amer. Math. Soc. 353 (2001), 3209-3227.
David Eppstein, Algorithms for Egyptian Fractions
David Eppstein, Ten Algorithms for Egyptian Fractions, Wolfram Library Archive.
Ron Knott Egyptian Fractions
Oakland University, The Erdős Number Project
Eric Weisstein's World of Mathematics, Egyptian Fraction
Index entries for sequences related to Egyptian fractions

Cf. A002966, A073546, A227610 (1/n), A227611 (2/n), A075785 (3/n), A073101 (4/n), A075248 (5/n).

f[m_, n_] := Length@ Solve[m/n == 1/x + 1/y + 1/z && 0 < x < y < z, {x, y, z}, Integers]; Table[ f[n, m - n + 1], {m, 12}, {n, m, 1, -1}]

A343074 Number of partitions of 1/n into n distinct reciprocals of positive integers.

Original entry on oeis.org

1, 1, 15, 586, 112535, 131223239

Offset: 1

Ilya Gutkovskiy, Apr 04 2021

			a(2) = 1 because we have 1/2 = 1/3 + 1/6.

Index entries for sequences related to Egyptian fractions

Cf. A006585, A063647, A227610, A241883, A342267.

a(5) from Bert Dobbelaere, Apr 05 2021

a(6) from Jud McCranie, Sep 03 2021

A347566 Number of ways 1/n can be expressed as the sum of five distinct unit fractions: 1/n = 1/p + 1/q + 1/r + 1/s + 1/t, with 0 < p < q < r < s < t.

Original entry on oeis.org

72, 2293, 15304, 47314, 112535, 190665, 368474, 577623, 925336, 1164976, 1478492, 2051830, 2240745, 3789424, 4989958, 4672559, 4467275, 7104589, 6548335, 13844524, 13580094, 10633142, 10451326, 20262957, 16621976, 18697914, 25613090, 27523671

Offset: 1

Jud McCranie, Sep 06 2021

nonn

Cf. A002966, A073546, A227610, A241883, A347569.

A347569 Number of ways 1/n can be expressed as the sum of six distinct unit fractions: 1/n = 1/p + 1/q + 1/r + 1/s + 1/t + 1/u, with 0 < p < q < r < s < t < u.

Original entry on oeis.org

2320, 244817, 3421052, 18420699, 64025680, 131223239, 431008820, 681922142

Offset: 1

Jud McCranie, Sep 06 2021

Cf. A002966, A073546, A227610, A241883, A347566.

a(7) and a(8) from Jud McCranie, Oct 15 2021

A351532 Number of integer pairs (i, j), 0 < i, j < n, such that i/(n - i) + j/(n - j) = 1.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 3, 0, 2, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 2, 5, 0, 0, 1, 2, 0, 1, 0, 0, 3, 0, 0, 1, 0, 0, 1, 0, 0, 3, 0, 2, 1, 0, 0, 3, 0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 5, 0, 0, 1, 0, 2, 1, 0, 2, 1, 0, 0, 3, 0, 0, 1, 0, 0, 7, 0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 0, 2, 3

Offset: 1

Lars Blomberg, Feb 14 2022

nonn

By symmetry, if (i, j) is a solution then so is (j, i). When j=i we get n = 3i, corresponding to the solution 1/2 + 1/2 = 1. Therefore, when 3|n, a(n) > 0 and odd, otherwise a(n) >= 0 and even.
For n < 10^6, the largest term is a(720720) = 285, and 483188 terms are 0.
Other record terms: a(1081080) = 369, a(2162160) = 457, a(3243240) = 481, a(4324320) = 533, a(5405400) = 559, a(6126120) = 597. Record terms with index >= 360360 appear to occur at indices that are multiples of 180180. - Chai Wah Wu, Feb 15 2022

			For n = 3: (i, j) = (1, 1), so a(3) = 1. (1/2 + 1/2 = 1)
For n = 18: (i, j) = (3, 8), (6, 6), (8, 3), so a(18) = 3. (3/15 + 8/10 = 1/5 + 4/5 = 1)
For n = 20: (i, j) = (5, 8), (8, 5), so a(20) = 2.
For n = 36: (i, j) = (6, 16), (8, 15), (12, 12), (15, 8), (16, 6), so a(36) = 5.

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A018892, A016017, A051908, A073546, A227610, A238795, A241883, A297895, A303400.

Cf. A351694, A351695 for records.

a(n)={my(x=n^2, y=2*n); sum(i=1,(n-1)/2, x-=2*n; y-=3; if(x%y==0,1,0))}

from sympy.abc import i, j
from sympy.solvers.diophantine.diophantine import diop_quadratic
def A351532(n):
    return sum(1 for d in diop_quadratic(n**2+3*i*j-2*n*(i+j)) if 0 < d[0] < n and 0 < d[1] < n) # Chai Wah Wu, Feb 15 2022

The original equation can be solved for j giving j = (n(n - 2i)) / (2n - 3i). Varying i from 1 to n-1, a(n) is given by the number of integer values of j, 0 < j < n.

Data section extended up to a(105) by Antti Karttunen, Jan 17 2025

cp's OEIS Frontend

A004194 Number of partitions of 1/n into 3 reciprocals of positive integers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A241883 Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A349083 The number of three-term Egyptian fractions of rational numbers x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r) such that x/y = 1/p + 1/q + 1/r where p, q, and r are integers with p < q < r.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A227611 Number of ways 2/n can be expressed as the sum of three distinct unit fractions: 2/n = 1/x + 1/y + 1/z with 0 < x < y < z.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A227612 Table read by antidiagonals: Number of ways m/n can be expressed as the sum of three distinct unit fractions, i.e., m/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A343074 Number of partitions of 1/n into n distinct reciprocals of positive integers.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A347566 Number of ways 1/n can be expressed as the sum of five distinct unit fractions: 1/n = 1/p + 1/q + 1/r + 1/s + 1/t, with 0 < p < q < r < s < t.

Views

Author

Keywords

Crossrefs

A347569 Number of ways 1/n can be expressed as the sum of six distinct unit fractions: 1/n = 1/p + 1/q + 1/r + 1/s + 1/t + 1/u, with 0 < p < q < r < s < t < u.

Views

Author

Keywords

Crossrefs

Extensions

A351532 Number of integer pairs (i, j), 0 < i, j < n, such that i/(n - i) + j/(n - j) = 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Python

Formula