cp's OEIS Frontend

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.

%I A281527 #18 Jan 24 2017 02:39:07
%S A281527 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,
%T A281527 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,
%U A281527 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
%N 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.
%H A281527 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%e A281527 The triangle T(n,k) begins:
%e A281527 2:                     1
%e A281527 3:                   1   2
%e A281527 4:                 1   1   2
%e A281527 5:               1   2   2   2
%e A281527 6:             1   1   1   2   2
%e A281527 7:           1   2   2   2   3   2
%e A281527 8:         1   1   2   1   2   2   2
%e A281527 9:       1   2   1   2   2   2   3   2
%Y A281527 Cf. A281530.
%K A281527 nonn,tabl
%O A281527 2,3
%A A281527 _Arkadiusz Wesolowski_, Jan 23 2017