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-4 of 4 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

A156869 Triangle read by rows: T(n,k) = number of nondecreasing sequences of n positive integers with reciprocals adding up to k (1 <= k <= n).

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 14, 4, 1, 1, 147, 17, 4, 1, 1, 3462, 164, 18, 4, 1, 1, 294314, 3627, 167, 18, 4, 1, 1, 159330691, 297976, 3644, 168, 18, 4, 1, 1
Offset: 1

Views

Author

Jens Voß, Feb 17 2009

Keywords

Comments

Conjecture: T(2n + m, n + m) = T(2n, n) ( = A156870(n) ) if and only if m >= 0.
Yes, the diagonals are constant for n <= 2k. Any such sequence must have at least one 1; remove that 1, and you get a sequence for n-1,k-1. - Franklin T. Adams-Watters, Feb 20 2009
The next term will be a(37) = A002966(9). - M. F. Hasler, Feb 20 2009

Examples

			Triangle begins:
n=1:      1
n=2:      1,    1
n=3:      3,    1,   1
n=4:     14,    4,   1,  1
n=5:    147,   17,   4,  1, 1
n=6:   3462,  164,  18,  4, 1, 1
n=7: 294314, 3627, 167, 18, 4, 1, 1
For n = 4 and k = 2, the T(4, 2) = 4 sequences are (1, 2, 3, 6), (1, 2, 4, 4), (1, 3, 3, 3) and (2, 2, 2, 2) because 1/1 + 1/2 + 1/3 + 1/6 = 1/1 + 1/2 + 1/4 + 1/4 = 1/1 + 1/3 + 1/3 + 1/3 = 1/2 + 1/2 + 1/2 + 1/2 = 2.
		

Crossrefs

Cf. A002966 (column k=1), A156871 (row sums), A280519, A280520.
T(2n, n) = A156870(n).

Programs

  • PARI
    { A156869(n,k,m=1) = n==1 & return(numerator(k)==1 & denominator(k)>=m); sum( i=max(m,1\k+1),n\k, A156869(n-1, k-1/i, i)); } \\ M. F. Hasler, Feb 20 2009

Extensions

a(21)-a(36) from M. F. Hasler, Feb 20 2009

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

Original entry on oeis.org

1, 0, 1, 7, 78, 2392, 248085, 151428144
Offset: 1

Views

Author

Max Alekseyev, Jan 04 2017

Keywords

Examples

			a(4)=7 enumerates sequences: (1,2,3,6), (2,4,5,20), (2,4,6,12), (2,3,7,42), (2,3,8,24), (2,3,9,18), and (2,3,10,15).
		

Crossrefs

Row sums of A280520.
Cf. A006585 (adding up to 1), A156871 (nondecreasing sequences), A280517 (ordered sequences).

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

Original entry on oeis.org

1, 1, 1, 10, 3, 1, 215, 41, 6, 1, 12231, 1115, 105, 10, 1, 2025462, 74862, 3466, 215, 15, 1, 1351857641, 14294210, 267281, 8372, 385, 21, 1, 6255560531733, 10837663111, 57646358, 727049, 17318, 630, 28, 1
Offset: 1

Views

Author

Max Alekseyev, Jan 04 2017

Keywords

Examples

			Triangle starts with:
n=1: 1
n=2: 1, 1
n=3: 10, 3, 1
n=4: 215, 41, 6, 1
n=5: 12231, 1115, 105, 10, 1
n=6: 2025462, 74862, 3466, 215, 15, 1
...
		

Crossrefs

Cf. A280517 (row sums), A002967 (column k=1), A156869 (nondecreasing sequences), A280520 (increasing sequences).
Showing 1-4 of 4 results.