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.

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

This page as a plain text file.
%I A002967 M4745 #58 Feb 16 2024 05:47:40
%S A002967 1,1,10,215,12231,2025462,1351857641,6255560531733
%N A002967 Egyptian fractions: number of solutions of 1 = 1/x_1 + ... + 1/x_n in positive integers.
%C A002967 Solutions differing only in the order of the x_i are counted as distinct.
%C A002967 All denominators in the expansion 1 = 1/x_1 + ... + 1/x_n are bounded by A000058(n-1) = A129871(n). - _Max Alekseyev_, Dec 30 2003
%D A002967 R. K. Guy, Unsolved Problems in Number Theory, D11.
%D A002967 D. Singmaster, "The number of representations of one as a sum of unit fractions," unpublished manuscript, 1972.
%D A002967 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002967 Zachary Harris and Joel Louwsma, <a href="https://arxiv.org/abs/1909.02022">On Arithmetical Structures on Complete Graphs</a>, arXiv:1909.02022 [math.NT], 2019. See also <a href="https://doi.org/10.2140/involve.2020.13.345">Involve</a> (2020) Vol. 13, No. 2, 345-355.
%H A002967 Claire Levaillant, <a href="https://arxiv.org/abs/2311.03668">On arithmetical structures on K9</a>, arXiv:2311.03668 [math.NT], 2023.
%H A002967 Putnam Competition, <a href="http://math.ucsd.edu/~pfitz/pastputnam.html">58th Putnam Mathematical Competition, 1997, Problem A-5</a>
%H A002967 D. Singmaster, <a href="/A002966/a002966.pdf">The number of representations of one as a sum of unit fractions</a>, Unpublished M.S., 1972.
%H A002967 Carlos E. Valencia and R. R. Villagrán, <a href="https://arxiv.org/abs/2101.05238">Algorithmic aspects of arithmetical structures</a>, arXiv:2101.05238 [math.NT], 2021.
%H A002967 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%e A002967 For n=3 the 10 solutions are {2,3,6} (6 ways), {2,4,4} (3 ways), {3,3,3} (1 way).
%Y A002967 Cf. A002966, A006585.
%Y A002967 Cf. A000058.
%K A002967 nonn,nice,hard,more
%O A002967 1,3
%A A002967 _N. J. A. Sloane_
%E A002967 a(7) from _Jud McCranie_
%E A002967 a(8) from John Dethridge, Jan 11 2004