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

A006585 Egyptian fractions: number of solutions to 1 = 1/x_1 + ... + 1/x_n in positive integers x_1 < ... < x_n.

Original entry on oeis.org

1, 0, 1, 6, 72, 2320, 245765, 151182379
Offset: 1

Views

Author

Keywords

Comments

All denominators in the expansion 1 = 1/x_1 + ... + 1/x_n are bounded by A000058(n-1), i.e., 0 < x_1 < ... < x_n < A000058(n-1). Furthermore, for a fixed n, x_i <= (n+1-i)*(A000058(i-1)-1). - Max Alekseyev, Oct 11 2012
If on the other hand, x_k need not be unique, see A002966. - Robert G. Wilson v, Jul 17 2013

Examples

			The 6 solutions for n=4 are 2,3,7,42; 2,3,8,24; 2,3,9,18; 2,3,10,15; 2,4,5,20; 2,4,6,12.
		

References

  • Marc LeBrun, personal communication.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Formula

a(n) = A280520(n,1).

Extensions

a(1)-a(7) are confirmed by Jud McCranie, Dec 11 1999
a(8) from John Dethridge (jcd(AT)ms.unimelb.edu.au), Jan 08 2004

A156871 Number of nondecreasing sequences of n positive integers with reciprocals adding up to an integer.

Original entry on oeis.org

1, 2, 5, 20, 170, 3650, 298132, 159632503
Offset: 1

Views

Author

Jens Voß, Feb 17 2009

Keywords

Examples

			For n = 3, the A156871(3) = 5 sequences are (1, 1, 1), (1, 2, 2), (2, 3, 6), (2, 4, 4) and (3, 3, 3) because 1/1 + 1/1 + 1/1 = 3, 1/1 + 1/2 + 1/2 = 2 and 1/2 + 1/3 + 1/6 = 1/2 + 1/4 + 1/4 = 1/3 + 1/3 + 1/3 = 1.
		

Crossrefs

Formula

a(n) = A156869(n, 1) + ... + A156869(n, n).

Extensions

a(7), a(8) from Max Alekseyev, Jul 27 2009

A280520 Triangle read by rows: T(n,k) = number of increasing sequences of n positive integers with reciprocals adding up to k (k=1,2,...,A055980(n)).

Original entry on oeis.org

1, 0, 1, 6, 1, 72, 6, 2320, 72, 245765, 2320, 151182379, 245765
Offset: 1

Views

Author

Max Alekseyev, Jan 04 2017

Keywords

Comments

T(n,k) = 0 for all k > A055980(n).
For n=3,...,11, we have T(n,2) = T(n-1,1). However, T(12,2) > T(11,1).
Conjecture: for n in A115515 (i.e., A055980(n+1)=A055980(n)+1), the sequences being enumerated by T(n,A055980(n)) must start with 1. E.g., there is no 10-tuple (x_1,x_2,...,x_10) with 1 < x_1 < ... < x_10 and 1/x_1 + ... + 1/x_10 = 2 (=A055980(10)).

Examples

			Triangle starts with:
n=1: 1
n=2: 0
n=3: 1
n=4: 6, 1
n=5: 72, 6
n=6: 2320, 72
n=7: 245765, 2320
n=8: 151182379, 245765
...
		

Crossrefs

Cf. A280518 (row sums), A006585 (column k=1), A156869 (nondecreasing sequences), A280519 (ordered sequences).

A280517 Number of sequences of n positive integers with reciprocals adding up to an integer.

Original entry on oeis.org

1, 2, 14, 263, 13462, 2104021, 1366427911, 6266456586228
Offset: 1

Views

Author

Max Alekseyev, Jan 04 2017

Keywords

Crossrefs

Row sums of A280519.
Cf. A002967 (adding up to 1), A156871 (nondecreasing sequences), A280518 (increasing sequences).

A374583 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_n such that 0 < x_1 < ... < x_n and x_k | x_n for all k = 1..n.

Original entry on oeis.org

1, 0, 1, 5, 44, 975, 59234, 15474226
Offset: 1

Views

Author

Max Alekseyev, Jul 12 2024

Keywords

Comments

Also, number of integers m such that m is the sum of n distinct divisors of m including 1.
x_n <= A000058(n-1)-1.

Crossrefs

Showing 1-5 of 5 results.