|
%I #33 Sep 18 2022 14:31:29
%S 1,1,2,1,1,2,1,2,2,3,1,1,1,2,2,1,2,3,2,3,3,1,1,2,1,2,2,3,1,2,1,2,2,2,
%T 3,3,1,1,2,2,1,2,2,3,3,1,2,2,2,3,2,3,4,4,4,1,1,1,1,2,1,2,2,2,2,3,1,2,
%U 3,3,3,3,2,3,3,3,3,4,1,1,2,2,2,3,1,2,2,3,3,3,4,1,2,1,2,1,2,3,2,2,2,3
%N Triangle read by rows: number of terms in unit fraction representation of k/n using the greedy algorithm, 1<=k<=n-1.
%H Seiichi Manyama, <a href="/A050205/b050205.txt">Rows n = 2..141, flattened</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/UnitFraction.html">Unit Fraction</a>.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions">Greedy algorithm for Egyptian fractions</a>.
%e 2/3 = 1/2 + 1/6. So T(3,2) = 2.
%e n\k | 1 2 3 4 5 6 7 8
%e ----*------------------------
%e 2 | 1;
%e 3 | 1, 2;
%e 4 | 1, 1, 2;
%e 5 | 1, 2, 2, 3;
%e 6 | 1, 1, 1, 2, 2;
%e 7 | 1, 2, 3, 2, 3, 3;
%e 8 | 1, 1, 2, 1, 2, 2, 3;
%e 9 | 1, 2, 1, 2, 2, 2, 3, 3;
%Y Cf. A050206, A050210 (Largest denominator), A260618.
%K nonn,easy,tabl
%O 2,3
%A _Eric W. Weisstein_
%E Offset changed to 2 by _Seiichi Manyama_, Sep 18 2022
|
