A281527 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A281527

Triangle read by rows: T(n,k) = minimal number of terms needed to write k/n as a signed sum of distinct unit fractions, 1 <= k < n.

3

1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 3, 3, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 3, 2, 3, 2

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

OFFSET

2,3

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

4: 1 1 2

5: 1 2 2 2

6: 1 1 1 2 2

7: 1 2 2 2 3 2

8: 1 1 2 1 2 2 2

9: 1 2 1 2 2 2 3 2

CROSSREFS

Sequence in context: A143421 A137672 A141272 * A124038 A029311 A217869

Adjacent sequences: A281524 A281525 A281526 * A281528 A281529 A281530

KEYWORD

nonn,tabl

AUTHOR

Arkadiusz Wesolowski, Jan 23 2017

STATUS

approved