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

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

Offset: 1

Author

Franklin T. Adams-Watters, Aug 31 2004

Keywords

• nonn
• tabf

Examples

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

Links

• Index entries for sequences related to Egyptian fractions

Crossrefs

Cf. A097847, A097849.