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.

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

Offset: 2

Author

Arkadiusz Wesolowski, Jan 23 2017

Keywords

• nonn
• tabl

Examples

			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
		

Links

• Index entries for sequences related to Egyptian fractions

Crossrefs

Cf. A281530.