For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.
A027443
For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.
Terms
- a(0) =1a(1) =15a(2) =35a(3) =1a(4) =165a(5) =91a(6) =1a(7) =153a(8) =247a(9) =1a(10) =207a(11) =75a(12) =1a(13) =435a(14) =651a(15) =1a(16) =63a(17) =185a(18) =1a(19) =615a(20) =1247a(21) =1a(22) =2961a(23) =245a(24) =1a(25) =371a(26) =99a(27) =1a(28) =1239a(29) =1891
External references
- oeis: A027443