# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a050206
Showing 1-1 of 1

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

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE