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

A342267 Number of partitions of 1/n into n reciprocals of positive integers.

Original entry on oeis.org

1, 2, 21, 694, 118995, 132891609
Offset: 1

Views

Author

Ilya Gutkovskiy, Mar 07 2021

Keywords

Examples

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

Crossrefs

Extensions

a(6) from Jud McCranie, Sep 02 2021

A369469 a(n) = number of integer solutions to 1 <= x1 < x2 < ... < xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

Original entry on oeis.org

1, 1, 1, 24, 293, 9219, 787444
Offset: 1

Views

Author

Max Alekseyev, Jan 23 2024

Keywords

Comments

For any n, A369470(n) >= a(n) >= 1 (see A369607).

Crossrefs

A369607 Greedy solution a(1) < a(2) < ... to 1/a(1) + 1/a(2) + ... = (1 - 1/a(1)) * (1 - 1/a(2)) * ....

Original entry on oeis.org

3, 6, 29, 803, 643727, 414383582243, 171713753231982206218247, 29485613049014079571725771288849499850026859243, 869401376876189366008603664962520703088459987798626788985159595026678611496977754082506135887
Offset: 1

Views

Author

Max Alekseyev, Jan 27 2024

Keywords

Comments

For any n, (x1, x2, ..., xn) = (a(1), a(2), ..., a(n-1), a(n)-1) forms a solution to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn), proving that A369470(n) >= A369469(n) >= 1.

Crossrefs

Formula

a(n+2) = a(n+1)^2 + (a(n) - 2)*a(n+1) - a(n)^3 + 2*a(n)^2 - 2*a(n) + 2.
Showing 1-3 of 3 results.