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

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

Offset: 1

Author

Franklin T. Adams-Watters, Aug 31 2004

Keywords

• nonn
• tabl

Examples

			Triangle begins:
1
1 1
1 2 1
1 1 2 1
1 2 2 3 1
1 1 1 2 2 1
1 2 3 2 3 3 1
1 1 2 1 2 2 3 1
1 2 1 2 2 2 3 3 1
1 1 2 2 1 2 2 3 3 1
1 2 2 2 3 2 3 4 4 4 1
		

Links

• Index entries for sequences related to Egyptian fractions

Crossrefs

Cf. A097848, A097849, A330808.

Row sums give A270429.

Formula

T(n, n-1) = A330808(n). - Jon E. Schoenfield, Jan 11 2020