A281530 - OEIS

A281530

Triangle read by rows: T(n,k) = number of terms for the shortest Egyptian fraction representation of k/n, 1 <= k < n.

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

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

OFFSET

2,3

COMMENTS

Not same as A050205. Example: the fraction 9/20 requires three terms in its greedy expansion, but 9/20 = 1/4 + 1/5, so T(20,9) = 2.

LINKS

Table of n, a(n) for n=2..106.

Index entries for sequences related to Egyptian fractions

EXAMPLE

The triangle T(n,k) begins:

2: 1

3: 1 2