login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346604 The second of four solutions to a Monthly problem asking if there exist finite sequences 1 < a(1) < a(2) < ... < a(n) such that Sum_i 1/a(i) = 1 and gcd(a(i), a(i+1)) = 1 for 1 <= i < n. 3
3, 5, 7, 9, 11, 21, 22, 45, 154 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..9.

Daniel Ullman, Proposer, Problem E3359, Amer. Math. Monthly, 98:2 (1991), 168.

Index entries for sequences related to Egyptian fractions

CROSSREFS

Cf. A346603, A346605, A346606.

Sequence in context: A103148 A211138 A178995 * A071240 A088049 A229364

Adjacent sequences:  A346601 A346602 A346603 * A346605 A346606 A346607

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Aug 06 2021

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)