The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A362289 a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1). 0
 2, 3, 12, 180, 30, 1428, 56, 2520, 90, 2310, 132, 100292556, 182, 9240, 240, 119952, 306, 614444040, 380, 23100, 462, 42190274940, 552, 77390453400, 650, 201474, 756, 23370247110, 870, 200880, 992, 14523137084239067683872, 1122, 2206260, 1260, 104845560637757648698080 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..36. FORMULA a(n) = A050210(n*(n+1), 2*n+1). - Michel Marcus, Apr 14 2023 EXAMPLE For n=16, 1/16 + 1/17 = 33/272 which written in Egyptian fractions is 1/9 + 1/98 + 1/119952 and the largest denominator is 119952. MATHEMATICA egyptFraction[f_] := Ceiling[1/Most[NestWhileList[# - 1/Ceiling[1/#] &, f, # != 0 &]]]; a[n_] := egyptFraction[1/n + 1/(n + 1)][[-1]]; Array[a, 40] (* Amiram Eldar, Apr 14 2023 *) CROSSREFS Cf. A050210. Sequence in context: A067338 A012713 A009814 * A345040 A196378 A336848 Adjacent sequences: A362286 A362287 A362288 * A362290 A362291 A362292 KEYWORD nonn AUTHOR Sebastian F. Orellana, Apr 14 2023 STATUS approved

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

Last modified August 7 17:47 EDT 2024. Contains 375017 sequences. (Running on oeis4.)