Triangle T(m,n) giving number of unit fractions (with odd denominators) needed to represent m/n, rational (n odd), using the greedy algorithm.
A069581
Triangle T(m,n) giving number of unit fractions (with odd denominators) needed to represent m/n, rational (n odd), using the greedy algorithm.
Terms
- a(0) =2a(1) =2a(2) =3a(3) =4a(4) =4a(5) =3a(6) =4a(7) =3a(8) =4a(9) =2a(10) =1a(11) =2a(12) =3a(13) =2a(14) =3a(15) =4a(16) =6a(17) =3a(18) =2a(19) =3a(20) =4a(21) =5a(22) =4a(23) =5a(24) =6a(25) =2a(26) =3a(27) =10a(28) =3a(29) =4
External references
- oeis: A069581