BBC Russian

A050205

Triangle read by rows: number of terms in unit fraction representation of k/n using the greedy algorithm, 1<=k<=n-1.

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, 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, 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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,3

LINKS

Seiichi Manyama, Rows n = 2..141, flattened

Eric Weisstein's World of Mathematics, Unit Fraction.

Wikipedia, Greedy algorithm for Egyptian fractions.

EXAMPLE

2/3 = 1/2 + 1/6. So T(3,2) = 2.

n\k | 1 2 3 4 5 6 7 8

----*------------------------

2 | 1;