a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).
A362289
a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).
Terms
- a(0) =2a(1) =3a(2) =12a(3) =180a(4) =30a(5) =1428a(6) =56a(7) =2520a(8) =90a(9) =2310a(10) =132a(11) =100292556a(12) =182a(13) =9240a(14) =240a(15) =119952a(16) =306a(17) =614444040a(18) =380a(19) =23100a(20) =462a(21) =42190274940a(22) =552a(23) =77390453400a(24) =650a(25) =201474a(26) =756a(27) =23370247110a(28) =870a(29) =200880
External references
- oeis: A362289